/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/clever.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:21:24,520 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:21:24,521 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:21:24,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:21:24,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:21:24,557 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:21:24,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:21:24,562 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:21:24,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:21:24,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:21:24,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:21:24,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:21:24,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:21:24,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:21:24,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:21:24,582 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:21:24,582 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:21:24,583 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:21:24,585 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:21:24,588 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:21:24,589 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:21:24,590 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:21:24,591 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:21:24,591 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:21:24,595 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:21:24,595 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:21:24,595 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:21:24,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:21:24,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:21:24,597 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:21:24,597 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:21:24,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:21:24,599 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:21:24,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:21:24,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:21:24,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:21:24,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:21:24,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:21:24,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:21:24,601 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:21:24,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:21:24,603 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-12-06 17:21:24,626 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:21:24,626 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:21:24,627 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:21:24,627 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:21:24,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:21:24,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:21:24,628 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:21:24,628 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:21:24,629 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:21:24,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:21:24,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:21:24,629 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:21:24,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:21:24,629 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:21:24,630 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:21:24,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:21:24,631 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:21:24,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:21:24,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:21:24,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:21:24,879 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:21:24,880 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:21:24,880 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:21:24,881 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-06 17:21:25,714 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:21:25,900 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:21:25,901 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c [2022-12-06 17:21:25,924 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74751a12b/198ad8b169134bb29e3ac6b10be0da8f/FLAGdf63f0c41 [2022-12-06 17:21:25,943 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74751a12b/198ad8b169134bb29e3ac6b10be0da8f [2022-12-06 17:21:25,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:21:25,946 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:21:25,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:21:25,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:21:25,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:21:25,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:25" (1/1) ... [2022-12-06 17:21:25,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15916c09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:25, skipping insertion in model container [2022-12-06 17:21:25,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:21:25" (1/1) ... [2022-12-06 17:21:25,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:21:25,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:21:26,111 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c[2133,2146] [2022-12-06 17:21:26,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:21:26,122 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:21:26,142 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/clever.wvr.c[2133,2146] [2022-12-06 17:21:26,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:21:26,154 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:21:26,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26 WrapperNode [2022-12-06 17:21:26,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:21:26,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:21:26,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:21:26,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:21:26,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,190 INFO L138 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2022-12-06 17:21:26,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:21:26,191 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:21:26,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:21:26,192 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:21:26,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,201 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,202 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,218 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,219 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:21:26,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:21:26,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:21:26,222 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:21:26,222 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (1/1) ... [2022-12-06 17:21:26,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:21:26,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:21:26,242 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-12-06 17:21:26,255 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-12-06 17:21:26,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:21:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:21:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:21:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:21:26,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:21:26,278 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:21:26,341 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:21:26,343 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:21:26,550 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:21:26,563 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:21:26,563 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 17:21:26,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:26 BoogieIcfgContainer [2022-12-06 17:21:26,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:21:26,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:21:26,567 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:21:26,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:21:26,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:21:25" (1/3) ... [2022-12-06 17:21:26,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cbf4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:26, skipping insertion in model container [2022-12-06 17:21:26,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:21:26" (2/3) ... [2022-12-06 17:21:26,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70cbf4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:21:26, skipping insertion in model container [2022-12-06 17:21:26,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:21:26" (3/3) ... [2022-12-06 17:21:26,570 INFO L112 eAbstractionObserver]: Analyzing ICFG clever.wvr.c [2022-12-06 17:21:26,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:21:26,584 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:21:26,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:21:26,659 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-06 17:21:26,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 112 transitions, 240 flow [2022-12-06 17:21:26,762 INFO L130 PetriNetUnfolder]: 9/110 cut-off events. [2022-12-06 17:21:26,763 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 17:21:26,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 110 events. 9/110 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2022-12-06 17:21:26,766 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 112 transitions, 240 flow [2022-12-06 17:21:26,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 102 transitions, 216 flow [2022-12-06 17:21:26,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:21:26,784 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;@36b6285d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:21:26,785 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-06 17:21:26,813 INFO L130 PetriNetUnfolder]: 9/101 cut-off events. [2022-12-06 17:21:26,813 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-06 17:21:26,813 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:26,814 INFO L213 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-12-06 17:21:26,815 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:21:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2136858828, now seen corresponding path program 1 times [2022-12-06 17:21:26,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:26,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528424109] [2022-12-06 17:21:26,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:26,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:27,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:27,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:27,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528424109] [2022-12-06 17:21:27,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528424109] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:21:27,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:21:27,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:21:27,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439252598] [2022-12-06 17:21:27,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:21:27,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:21:27,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:27,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:21:27,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:21:27,664 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 112 [2022-12-06 17:21:27,668 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 102 transitions, 216 flow. Second operand has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 0 states have call successors, (0), 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-12-06 17:21:27,668 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:27,668 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 112 [2022-12-06 17:21:27,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:21:27,844 INFO L130 PetriNetUnfolder]: 18/159 cut-off events. [2022-12-06 17:21:27,844 INFO L131 PetriNetUnfolder]: For 27/28 co-relation queries the response was YES. [2022-12-06 17:21:27,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 159 events. 18/159 cut-off events. For 27/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 364 event pairs, 2 based on Foata normal form. 22/168 useless extension candidates. Maximal degree in co-relation 106. Up to 32 conditions per place. [2022-12-06 17:21:27,847 INFO L137 encePairwiseOnDemand]: 95/112 looper letters, 23 selfloop transitions, 5 changer transitions 8/106 dead transitions. [2022-12-06 17:21:27,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 305 flow [2022-12-06 17:21:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:21:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:21:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 837 transitions. [2022-12-06 17:21:27,862 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7473214285714286 [2022-12-06 17:21:27,865 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2022-12-06 17:21:27,865 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 305 flow [2022-12-06 17:21:27,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 81.85714285714286) internal successors, (573), 7 states have internal predecessors, (573), 0 states have call successors, (0), 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-12-06 17:21:27,866 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:27,866 INFO L213 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-12-06 17:21:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:21:27,867 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:21:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1613440896, now seen corresponding path program 1 times [2022-12-06 17:21:27,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:27,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905604903] [2022-12-06 17:21:27,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:27,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:28,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905604903] [2022-12-06 17:21:28,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905604903] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:21:28,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:21:28,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:21:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017911601] [2022-12-06 17:21:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:21:28,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:21:28,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:21:28,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:21:28,025 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 112 [2022-12-06 17:21:28,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:21:28,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:28,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 112 [2022-12-06 17:21:28,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:21:28,158 INFO L130 PetriNetUnfolder]: 112/424 cut-off events. [2022-12-06 17:21:28,158 INFO L131 PetriNetUnfolder]: For 160/168 co-relation queries the response was YES. [2022-12-06 17:21:28,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 424 events. 112/424 cut-off events. For 160/168 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2189 event pairs, 21 based on Foata normal form. 2/373 useless extension candidates. Maximal degree in co-relation 570. Up to 105 conditions per place. [2022-12-06 17:21:28,165 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 43 selfloop transitions, 11 changer transitions 17/137 dead transitions. [2022-12-06 17:21:28,165 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 137 transitions, 557 flow [2022-12-06 17:21:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 17:21:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 17:21:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 638 transitions. [2022-12-06 17:21:28,166 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7120535714285714 [2022-12-06 17:21:28,167 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 16 predicate places. [2022-12-06 17:21:28,167 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 137 transitions, 557 flow [2022-12-06 17:21:28,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:21:28,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:28,169 INFO L213 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-12-06 17:21:28,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:21:28,171 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:21:28,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1870012246, now seen corresponding path program 2 times [2022-12-06 17:21:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:28,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486541377] [2022-12-06 17:21:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:28,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486541377] [2022-12-06 17:21:28,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486541377] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:21:28,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:21:28,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:21:28,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378014909] [2022-12-06 17:21:28,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:21:28,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:21:28,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:28,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:21:28,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:21:28,350 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 112 [2022-12-06 17:21:28,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 137 transitions, 557 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:21:28,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:28,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 112 [2022-12-06 17:21:28,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:21:28,465 INFO L130 PetriNetUnfolder]: 107/421 cut-off events. [2022-12-06 17:21:28,465 INFO L131 PetriNetUnfolder]: For 292/371 co-relation queries the response was YES. [2022-12-06 17:21:28,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 421 events. 107/421 cut-off events. For 292/371 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2086 event pairs, 9 based on Foata normal form. 17/387 useless extension candidates. Maximal degree in co-relation 723. Up to 104 conditions per place. [2022-12-06 17:21:28,467 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 48 selfloop transitions, 15 changer transitions 19/148 dead transitions. [2022-12-06 17:21:28,467 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 148 transitions, 775 flow [2022-12-06 17:21:28,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 17:21:28,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 17:21:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 636 transitions. [2022-12-06 17:21:28,469 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7098214285714286 [2022-12-06 17:21:28,470 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 23 predicate places. [2022-12-06 17:21:28,470 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 148 transitions, 775 flow [2022-12-06 17:21:28,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:21:28,470 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:21:28,470 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:21:28,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:21:28,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:21:28,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:21:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1150686863, now seen corresponding path program 1 times [2022-12-06 17:21:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:21:28,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419312617] [2022-12-06 17:21:28,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:21:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:29,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:21:29,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419312617] [2022-12-06 17:21:29,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419312617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:21:29,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132630019] [2022-12-06 17:21:29,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:21:29,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:21:29,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:21:29,083 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-12-06 17:21:29,088 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-12-06 17:21:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:21:29,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 17:21:29,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:21:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:52,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:21:53,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:21:53,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132630019] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:21:53,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:21:53,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 30 [2022-12-06 17:21:53,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268035210] [2022-12-06 17:21:53,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:21:53,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-06 17:21:53,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:21:53,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-06 17:21:53,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=685, Unknown=10, NotChecked=0, Total=870 [2022-12-06 17:21:53,767 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 112 [2022-12-06 17:21:53,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 148 transitions, 775 flow. Second operand has 30 states, 30 states have (on average 66.26666666666667) internal successors, (1988), 30 states have internal predecessors, (1988), 0 states have call successors, (0), 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-12-06 17:21:53,769 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:21:53,769 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 112 [2022-12-06 17:21:53,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:02,927 INFO L130 PetriNetUnfolder]: 292/993 cut-off events. [2022-12-06 17:22:02,927 INFO L131 PetriNetUnfolder]: For 1110/1328 co-relation queries the response was YES. [2022-12-06 17:22:02,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2857 conditions, 993 events. 292/993 cut-off events. For 1110/1328 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6742 event pairs, 27 based on Foata normal form. 33/901 useless extension candidates. Maximal degree in co-relation 2286. Up to 282 conditions per place. [2022-12-06 17:22:02,932 INFO L137 encePairwiseOnDemand]: 92/112 looper letters, 124 selfloop transitions, 33 changer transitions 37/259 dead transitions. [2022-12-06 17:22:02,933 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 259 transitions, 1808 flow [2022-12-06 17:22:02,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-06 17:22:02,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2022-12-06 17:22:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2049 transitions. [2022-12-06 17:22:02,946 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6098214285714286 [2022-12-06 17:22:02,946 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 52 predicate places. [2022-12-06 17:22:02,946 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 259 transitions, 1808 flow [2022-12-06 17:22:02,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 66.26666666666667) internal successors, (1988), 30 states have internal predecessors, (1988), 0 states have call successors, (0), 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-12-06 17:22:02,947 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:02,948 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:02,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 17:22:03,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:03,153 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:03,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:03,153 INFO L85 PathProgramCache]: Analyzing trace with hash -247160025, now seen corresponding path program 2 times [2022-12-06 17:22:03,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:03,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638366737] [2022-12-06 17:22:03,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:03,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:03,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638366737] [2022-12-06 17:22:03,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638366737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:22:03,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254706404] [2022-12-06 17:22:03,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:22:03,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:03,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:22:03,804 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-12-06 17:22:03,835 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-12-06 17:22:03,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:22:03,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:22:03,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 17:22:03,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:22:15,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:15,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:22:17,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:17,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254706404] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:22:17,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:22:17,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 28 [2022-12-06 17:22:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372697359] [2022-12-06 17:22:17,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:22:17,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-06 17:22:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:17,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-06 17:22:17,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=599, Unknown=1, NotChecked=0, Total=756 [2022-12-06 17:22:17,917 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 112 [2022-12-06 17:22:17,919 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 259 transitions, 1808 flow. Second operand has 28 states, 28 states have (on average 66.39285714285714) internal successors, (1859), 28 states have internal predecessors, (1859), 0 states have call successors, (0), 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-12-06 17:22:17,919 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:17,919 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 112 [2022-12-06 17:22:17,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:21,095 INFO L130 PetriNetUnfolder]: 768/2427 cut-off events. [2022-12-06 17:22:21,096 INFO L131 PetriNetUnfolder]: For 4138/4572 co-relation queries the response was YES. [2022-12-06 17:22:21,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8412 conditions, 2427 events. 768/2427 cut-off events. For 4138/4572 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19605 event pairs, 96 based on Foata normal form. 55/2140 useless extension candidates. Maximal degree in co-relation 7099. Up to 820 conditions per place. [2022-12-06 17:22:21,113 INFO L137 encePairwiseOnDemand]: 92/112 looper letters, 313 selfloop transitions, 75 changer transitions 117/570 dead transitions. [2022-12-06 17:22:21,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 570 transitions, 5396 flow [2022-12-06 17:22:21,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-06 17:22:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-12-06 17:22:21,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3039 transitions. [2022-12-06 17:22:21,119 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6166801948051948 [2022-12-06 17:22:21,119 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 95 predicate places. [2022-12-06 17:22:21,119 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 570 transitions, 5396 flow [2022-12-06 17:22:21,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 66.39285714285714) internal successors, (1859), 28 states have internal predecessors, (1859), 0 states have call successors, (0), 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-12-06 17:22:21,120 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:21,120 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:21,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 17:22:21,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:21,325 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:21,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:21,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1990706603, now seen corresponding path program 3 times [2022-12-06 17:22:21,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:21,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460240305] [2022-12-06 17:22:21,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:21,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:21,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460240305] [2022-12-06 17:22:21,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460240305] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:22:21,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447594658] [2022-12-06 17:22:21,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:22:21,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:21,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:22:21,894 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-12-06 17:22:21,896 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-12-06 17:22:21,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 17:22:21,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:22:21,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 19 conjunts are in the unsatisfiable core [2022-12-06 17:22:21,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:22:22,674 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:22,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:22:23,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:23,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447594658] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:22:23,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:22:23,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 25 [2022-12-06 17:22:23,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258486305] [2022-12-06 17:22:23,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:22:23,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-06 17:22:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:23,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-06 17:22:23,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=475, Unknown=0, NotChecked=0, Total=600 [2022-12-06 17:22:23,201 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 112 [2022-12-06 17:22:23,203 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 570 transitions, 5396 flow. Second operand has 25 states, 25 states have (on average 72.08) internal successors, (1802), 25 states have internal predecessors, (1802), 0 states have call successors, (0), 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-12-06 17:22:23,203 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:23,203 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 112 [2022-12-06 17:22:23,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:25,840 INFO L130 PetriNetUnfolder]: 1371/4348 cut-off events. [2022-12-06 17:22:25,840 INFO L131 PetriNetUnfolder]: For 10047/10695 co-relation queries the response was YES. [2022-12-06 17:22:25,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16379 conditions, 4348 events. 1371/4348 cut-off events. For 10047/10695 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 39188 event pairs, 227 based on Foata normal form. 82/3800 useless extension candidates. Maximal degree in co-relation 12384. Up to 1560 conditions per place. [2022-12-06 17:22:25,866 INFO L137 encePairwiseOnDemand]: 93/112 looper letters, 248 selfloop transitions, 120 changer transitions 208/812 dead transitions. [2022-12-06 17:22:25,866 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 812 transitions, 9030 flow [2022-12-06 17:22:25,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 17:22:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-06 17:22:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2886 transitions. [2022-12-06 17:22:25,869 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6607142857142857 [2022-12-06 17:22:25,870 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 133 predicate places. [2022-12-06 17:22:25,870 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 812 transitions, 9030 flow [2022-12-06 17:22:25,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 72.08) internal successors, (1802), 25 states have internal predecessors, (1802), 0 states have call successors, (0), 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-12-06 17:22:25,870 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:25,870 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:25,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-06 17:22:26,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:26,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:26,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:26,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1395500624, now seen corresponding path program 1 times [2022-12-06 17:22:26,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:26,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938588878] [2022-12-06 17:22:26,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:26,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:26,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:26,195 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:22:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:26,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938588878] [2022-12-06 17:22:26,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938588878] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:22:26,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:22:26,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:22:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496304886] [2022-12-06 17:22:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:22:26,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:22:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:22:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:22:26,197 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 112 [2022-12-06 17:22:26,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 812 transitions, 9030 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:22:26,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:26,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 112 [2022-12-06 17:22:26,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:26,795 INFO L130 PetriNetUnfolder]: 1395/4801 cut-off events. [2022-12-06 17:22:26,795 INFO L131 PetriNetUnfolder]: For 16574/17641 co-relation queries the response was YES. [2022-12-06 17:22:26,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19949 conditions, 4801 events. 1395/4801 cut-off events. For 16574/17641 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 45351 event pairs, 52 based on Foata normal form. 74/4291 useless extension candidates. Maximal degree in co-relation 16598. Up to 1692 conditions per place. [2022-12-06 17:22:26,863 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 418 selfloop transitions, 28 changer transitions 240/983 dead transitions. [2022-12-06 17:22:26,863 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 983 transitions, 12648 flow [2022-12-06 17:22:26,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 17:22:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 17:22:26,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 642 transitions. [2022-12-06 17:22:26,864 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7165178571428571 [2022-12-06 17:22:26,865 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 140 predicate places. [2022-12-06 17:22:26,865 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 983 transitions, 12648 flow [2022-12-06 17:22:26,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:22:26,865 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:26,865 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:26,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 17:22:26,866 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:26,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1390304728, now seen corresponding path program 2 times [2022-12-06 17:22:26,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:26,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941727701] [2022-12-06 17:22:26,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:26,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:26,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:22:26,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:26,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941727701] [2022-12-06 17:22:26,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941727701] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:22:26,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:22:26,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:22:26,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630623841] [2022-12-06 17:22:26,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:22:26,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:22:26,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:22:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:22:26,949 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 112 [2022-12-06 17:22:26,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 983 transitions, 12648 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:22:26,950 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:26,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 112 [2022-12-06 17:22:26,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:27,706 INFO L130 PetriNetUnfolder]: 1395/4744 cut-off events. [2022-12-06 17:22:27,706 INFO L131 PetriNetUnfolder]: For 21149/22322 co-relation queries the response was YES. [2022-12-06 17:22:27,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22182 conditions, 4744 events. 1395/4744 cut-off events. For 21149/22322 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 44668 event pairs, 51 based on Foata normal form. 54/4221 useless extension candidates. Maximal degree in co-relation 19514. Up to 1705 conditions per place. [2022-12-06 17:22:27,728 INFO L137 encePairwiseOnDemand]: 102/112 looper letters, 400 selfloop transitions, 34 changer transitions 235/966 dead transitions. [2022-12-06 17:22:27,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 966 transitions, 13715 flow [2022-12-06 17:22:27,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-06 17:22:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-06 17:22:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 635 transitions. [2022-12-06 17:22:27,729 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7087053571428571 [2022-12-06 17:22:27,732 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 147 predicate places. [2022-12-06 17:22:27,732 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 966 transitions, 13715 flow [2022-12-06 17:22:27,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 0 states have call successors, (0), 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-12-06 17:22:27,732 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:27,732 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:27,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:22:27,732 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:27,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:27,733 INFO L85 PathProgramCache]: Analyzing trace with hash 301081796, now seen corresponding path program 1 times [2022-12-06 17:22:27,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:27,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142775503] [2022-12-06 17:22:27,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:27,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:22:28,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:28,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142775503] [2022-12-06 17:22:28,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142775503] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:22:28,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764819160] [2022-12-06 17:22:28,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:28,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:28,296 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:22:28,297 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-12-06 17:22:28,298 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-12-06 17:22:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:28,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 17:22:28,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:22:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:29,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:22:29,950 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:22:29,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764819160] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:22:29,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:22:29,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 31 [2022-12-06 17:22:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233673584] [2022-12-06 17:22:29,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:22:29,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 17:22:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 17:22:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=806, Unknown=0, NotChecked=0, Total=930 [2022-12-06 17:22:29,953 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 112 [2022-12-06 17:22:29,955 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 966 transitions, 13715 flow. Second operand has 31 states, 31 states have (on average 70.12903225806451) internal successors, (2174), 31 states have internal predecessors, (2174), 0 states have call successors, (0), 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-12-06 17:22:29,955 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:29,955 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 112 [2022-12-06 17:22:29,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:33,564 INFO L130 PetriNetUnfolder]: 1764/5974 cut-off events. [2022-12-06 17:22:33,564 INFO L131 PetriNetUnfolder]: For 32257/34024 co-relation queries the response was YES. [2022-12-06 17:22:33,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29912 conditions, 5974 events. 1764/5974 cut-off events. For 32257/34024 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 59515 event pairs, 73 based on Foata normal form. 138/5409 useless extension candidates. Maximal degree in co-relation 24133. Up to 2187 conditions per place. [2022-12-06 17:22:33,594 INFO L137 encePairwiseOnDemand]: 90/112 looper letters, 448 selfloop transitions, 169 changer transitions 261/1185 dead transitions. [2022-12-06 17:22:33,595 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 1185 transitions, 18475 flow [2022-12-06 17:22:33,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-12-06 17:22:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2022-12-06 17:22:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 4087 transitions. [2022-12-06 17:22:33,599 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6401942355889725 [2022-12-06 17:22:33,600 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 203 predicate places. [2022-12-06 17:22:33,600 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 1185 transitions, 18475 flow [2022-12-06 17:22:33,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 70.12903225806451) internal successors, (2174), 31 states have internal predecessors, (2174), 0 states have call successors, (0), 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-12-06 17:22:33,602 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:22:33,602 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:22:33,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-06 17:22:33,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:33,807 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:22:33,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:22:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2143267600, now seen corresponding path program 2 times [2022-12-06 17:22:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:22:33,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831611864] [2022-12-06 17:22:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:22:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:22:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:22:34,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:22:34,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:22:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831611864] [2022-12-06 17:22:34,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831611864] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:22:34,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707992711] [2022-12-06 17:22:34,475 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:22:34,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:22:34,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:22:34,476 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-12-06 17:22:34,478 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-12-06 17:22:34,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:22:34,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:22:34,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 17:22:34,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:22:35,887 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:35,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:22:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:22:36,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707992711] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:22:36,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:22:36,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 37 [2022-12-06 17:22:36,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126232173] [2022-12-06 17:22:36,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:22:36,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-06 17:22:36,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:22:36,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-06 17:22:36,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1142, Unknown=0, NotChecked=0, Total=1332 [2022-12-06 17:22:36,987 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 112 [2022-12-06 17:22:36,988 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 1185 transitions, 18475 flow. Second operand has 37 states, 37 states have (on average 67.32432432432432) internal successors, (2491), 37 states have internal predecessors, (2491), 0 states have call successors, (0), 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-12-06 17:22:36,989 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:22:36,989 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 112 [2022-12-06 17:22:36,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:22:42,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:22:46,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:22:55,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:23:03,137 INFO L130 PetriNetUnfolder]: 2736/9420 cut-off events. [2022-12-06 17:23:03,137 INFO L131 PetriNetUnfolder]: For 61110/64261 co-relation queries the response was YES. [2022-12-06 17:23:03,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49777 conditions, 9420 events. 2736/9420 cut-off events. For 61110/64261 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 102226 event pairs, 149 based on Foata normal form. 362/8679 useless extension candidates. Maximal degree in co-relation 40886. Up to 3621 conditions per place. [2022-12-06 17:23:03,186 INFO L137 encePairwiseOnDemand]: 85/112 looper letters, 617 selfloop transitions, 404 changer transitions 381/1706 dead transitions. [2022-12-06 17:23:03,186 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1706 transitions, 29816 flow [2022-12-06 17:23:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-12-06 17:23:03,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2022-12-06 17:23:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 6656 transitions. [2022-12-06 17:23:03,191 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6126656848306333 [2022-12-06 17:23:03,191 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 297 predicate places. [2022-12-06 17:23:03,192 INFO L495 AbstractCegarLoop]: Abstraction has has 397 places, 1706 transitions, 29816 flow [2022-12-06 17:23:03,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 67.32432432432432) internal successors, (2491), 37 states have internal predecessors, (2491), 0 states have call successors, (0), 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-12-06 17:23:03,192 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:23:03,193 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:23:03,200 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-12-06 17:23:03,397 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,SelfDestructingSolverStorable9 [2022-12-06 17:23:03,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:23:03,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:23:03,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1516265988, now seen corresponding path program 3 times [2022-12-06 17:23:03,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:23:03,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081313916] [2022-12-06 17:23:03,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:23:03,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:23:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:23:04,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:23:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:23:04,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081313916] [2022-12-06 17:23:04,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081313916] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:23:04,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148646177] [2022-12-06 17:23:04,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:23:04,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:23:04,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:23:04,109 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-12-06 17:23:04,111 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-12-06 17:23:04,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 17:23:04,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:23:04,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 17:23:04,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:23:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:23:05,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:23:07,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 17:23:07,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148646177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:23:07,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:23:07,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 35 [2022-12-06 17:23:07,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474154043] [2022-12-06 17:23:07,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:23:07,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 17:23:07,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:23:07,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 17:23:07,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1039, Unknown=0, NotChecked=0, Total=1190 [2022-12-06 17:23:07,443 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 112 [2022-12-06 17:23:07,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 1706 transitions, 29816 flow. Second operand has 35 states, 35 states have (on average 64.51428571428572) internal successors, (2258), 35 states have internal predecessors, (2258), 0 states have call successors, (0), 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-12-06 17:23:07,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:23:07,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 112 [2022-12-06 17:23:07,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:23:13,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:23:16,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:23:18,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:23:28,760 INFO L130 PetriNetUnfolder]: 2955/10164 cut-off events. [2022-12-06 17:23:28,760 INFO L131 PetriNetUnfolder]: For 77883/81615 co-relation queries the response was YES. [2022-12-06 17:23:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58829 conditions, 10164 events. 2955/10164 cut-off events. For 77883/81615 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 112188 event pairs, 139 based on Foata normal form. 323/9291 useless extension candidates. Maximal degree in co-relation 42787. Up to 4216 conditions per place. [2022-12-06 17:23:28,818 INFO L137 encePairwiseOnDemand]: 89/112 looper letters, 1162 selfloop transitions, 261 changer transitions 417/1912 dead transitions. [2022-12-06 17:23:28,818 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 1912 transitions, 36659 flow [2022-12-06 17:23:28,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-06 17:23:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-06 17:23:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3964 transitions. [2022-12-06 17:23:28,822 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5898809523809524 [2022-12-06 17:23:28,822 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 356 predicate places. [2022-12-06 17:23:28,822 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 1912 transitions, 36659 flow [2022-12-06 17:23:28,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 64.51428571428572) internal successors, (2258), 35 states have internal predecessors, (2258), 0 states have call successors, (0), 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-12-06 17:23:28,823 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:23:28,823 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:23:28,828 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-12-06 17:23:29,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:23:29,028 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:23:29,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:23:29,029 INFO L85 PathProgramCache]: Analyzing trace with hash -608662430, now seen corresponding path program 4 times [2022-12-06 17:23:29,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:23:29,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380327668] [2022-12-06 17:23:29,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:23:29,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:23:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:23:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:23:29,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:23:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380327668] [2022-12-06 17:23:29,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380327668] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:23:29,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997069608] [2022-12-06 17:23:29,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:23:29,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:23:29,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:23:29,649 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-12-06 17:23:29,651 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-12-06 17:23:29,775 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:23:29,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:23:29,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 17:23:29,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:23:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:23:30,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:23:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:23:32,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997069608] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:23:32,993 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:23:32,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2022-12-06 17:23:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596006776] [2022-12-06 17:23:32,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:23:32,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 17:23:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:23:32,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 17:23:32,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2022-12-06 17:23:32,996 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 112 [2022-12-06 17:23:32,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1912 transitions, 36659 flow. Second operand has 32 states, 32 states have (on average 70.125) internal successors, (2244), 32 states have internal predecessors, (2244), 0 states have call successors, (0), 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-12-06 17:23:32,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:23:32,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 112 [2022-12-06 17:23:32,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:23:36,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:23:41,367 INFO L130 PetriNetUnfolder]: 3118/10657 cut-off events. [2022-12-06 17:23:41,367 INFO L131 PetriNetUnfolder]: For 95785/100330 co-relation queries the response was YES. [2022-12-06 17:23:41,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65477 conditions, 10657 events. 3118/10657 cut-off events. For 95785/100330 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 118129 event pairs, 108 based on Foata normal form. 263/9669 useless extension candidates. Maximal degree in co-relation 47725. Up to 4486 conditions per place. [2022-12-06 17:23:41,432 INFO L137 encePairwiseOnDemand]: 90/112 looper letters, 934 selfloop transitions, 253 changer transitions 435/2005 dead transitions. [2022-12-06 17:23:41,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 496 places, 2005 transitions, 41468 flow [2022-12-06 17:23:41,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-12-06 17:23:41,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2022-12-06 17:23:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2930 transitions. [2022-12-06 17:23:41,438 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6380662020905923 [2022-12-06 17:23:41,438 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 396 predicate places. [2022-12-06 17:23:41,438 INFO L495 AbstractCegarLoop]: Abstraction has has 496 places, 2005 transitions, 41468 flow [2022-12-06 17:23:41,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 70.125) internal successors, (2244), 32 states have internal predecessors, (2244), 0 states have call successors, (0), 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-12-06 17:23:41,439 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:23:41,439 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:23:41,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-06 17:23:41,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:23:41,645 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:23:41,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:23:41,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1005097750, now seen corresponding path program 5 times [2022-12-06 17:23:41,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:23:41,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974280762] [2022-12-06 17:23:41,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:23:41,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:23:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:23:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:23:42,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:23:42,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974280762] [2022-12-06 17:23:42,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974280762] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:23:42,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957214180] [2022-12-06 17:23:42,256 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 17:23:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:23:42,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:23:42,258 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-12-06 17:23:42,259 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-12-06 17:23:42,422 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-12-06 17:23:42,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:23:42,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 17:23:42,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:23:43,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:23:43,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:23:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:23:46,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957214180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:23:46,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:23:46,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 14] total 35 [2022-12-06 17:23:46,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945209935] [2022-12-06 17:23:46,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:23:46,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-06 17:23:46,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:23:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-06 17:23:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1020, Unknown=0, NotChecked=0, Total=1190 [2022-12-06 17:23:46,241 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 112 [2022-12-06 17:23:46,242 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 2005 transitions, 41468 flow. Second operand has 35 states, 35 states have (on average 64.51428571428572) internal successors, (2258), 35 states have internal predecessors, (2258), 0 states have call successors, (0), 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-12-06 17:23:46,242 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:23:46,242 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 112 [2022-12-06 17:23:46,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:23:50,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:23:55,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 17:24:07,440 INFO L130 PetriNetUnfolder]: 3268/11150 cut-off events. [2022-12-06 17:24:07,440 INFO L131 PetriNetUnfolder]: For 119502/126382 co-relation queries the response was YES. [2022-12-06 17:24:07,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74319 conditions, 11150 events. 3268/11150 cut-off events. For 119502/126382 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 124606 event pairs, 112 based on Foata normal form. 414/10257 useless extension candidates. Maximal degree in co-relation 61734. Up to 4931 conditions per place. [2022-12-06 17:24:07,524 INFO L137 encePairwiseOnDemand]: 89/112 looper letters, 1345 selfloop transitions, 281 changer transitions 456/2154 dead transitions. [2022-12-06 17:24:07,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 2154 transitions, 48383 flow [2022-12-06 17:24:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-12-06 17:24:07,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-12-06 17:24:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 3287 transitions. [2022-12-06 17:24:07,527 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5869642857142857 [2022-12-06 17:24:07,528 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 445 predicate places. [2022-12-06 17:24:07,528 INFO L495 AbstractCegarLoop]: Abstraction has has 545 places, 2154 transitions, 48383 flow [2022-12-06 17:24:07,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 64.51428571428572) internal successors, (2258), 35 states have internal predecessors, (2258), 0 states have call successors, (0), 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-12-06 17:24:07,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:24:07,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:24:07,533 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-12-06 17:24:07,729 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,SelfDestructingSolverStorable12 [2022-12-06 17:24:07,730 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:24:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:24:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash -2053102328, now seen corresponding path program 6 times [2022-12-06 17:24:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:24:07,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520089159] [2022-12-06 17:24:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:24:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:24:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:24:08,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:24:08,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:24:08,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520089159] [2022-12-06 17:24:08,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520089159] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:24:08,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416662573] [2022-12-06 17:24:08,245 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 17:24:08,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:24:08,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:24:08,246 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-12-06 17:24:08,247 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-12-06 17:24:08,395 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-12-06 17:24:08,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:24:08,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 17:24:08,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:24:09,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:24:09,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:24:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:24:12,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416662573] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:24:12,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:24:12,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 37 [2022-12-06 17:24:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588698850] [2022-12-06 17:24:12,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:24:12,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-06 17:24:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:24:12,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-06 17:24:12,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1115, Unknown=0, NotChecked=0, Total=1332 [2022-12-06 17:24:12,263 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 112 [2022-12-06 17:24:12,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 2154 transitions, 48383 flow. Second operand has 37 states, 37 states have (on average 67.32432432432432) internal successors, (2491), 37 states have internal predecessors, (2491), 0 states have call successors, (0), 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-12-06 17:24:12,265 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:24:12,265 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 112 [2022-12-06 17:24:12,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:24:16,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-06 17:24:23,077 INFO L130 PetriNetUnfolder]: 3452/11811 cut-off events. [2022-12-06 17:24:23,077 INFO L131 PetriNetUnfolder]: For 146420/154764 co-relation queries the response was YES. [2022-12-06 17:24:23,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82647 conditions, 11811 events. 3452/11811 cut-off events. For 146420/154764 co-relation queries the response was YES. Maximal size of possible extension queue 450. Compared 133424 event pairs, 121 based on Foata normal form. 577/11011 useless extension candidates. Maximal degree in co-relation 72766. Up to 5220 conditions per place. [2022-12-06 17:24:23,156 INFO L137 encePairwiseOnDemand]: 85/112 looper letters, 902 selfloop transitions, 484 changer transitions 475/2278 dead transitions. [2022-12-06 17:24:23,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 2278 transitions, 54755 flow [2022-12-06 17:24:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-12-06 17:24:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-12-06 17:24:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 3353 transitions. [2022-12-06 17:24:23,167 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.610969387755102 [2022-12-06 17:24:23,168 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 493 predicate places. [2022-12-06 17:24:23,168 INFO L495 AbstractCegarLoop]: Abstraction has has 593 places, 2278 transitions, 54755 flow [2022-12-06 17:24:23,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 67.32432432432432) internal successors, (2491), 37 states have internal predecessors, (2491), 0 states have call successors, (0), 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-12-06 17:24:23,168 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:24:23,169 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:24:23,176 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-12-06 17:24:23,376 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,SelfDestructingSolverStorable13 [2022-12-06 17:24:23,377 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:24:23,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:24:23,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1970345046, now seen corresponding path program 7 times [2022-12-06 17:24:23,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:24:23,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090033855] [2022-12-06 17:24:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:24:23,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:24:23,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:24:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:24:23,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:24:23,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090033855] [2022-12-06 17:24:23,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090033855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:24:23,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771288640] [2022-12-06 17:24:23,877 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 17:24:23,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:24:23,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:24:23,878 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-12-06 17:24:23,879 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-12-06 17:24:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:24:23,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 24 conjunts are in the unsatisfiable core [2022-12-06 17:24:23,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:24:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:24:24,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:24:26,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:24:26,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771288640] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:24:26,464 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:24:26,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 15] total 37 [2022-12-06 17:24:26,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082622712] [2022-12-06 17:24:26,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:24:26,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-06 17:24:26,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:24:26,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-06 17:24:26,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2022-12-06 17:24:26,467 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 112 [2022-12-06 17:24:26,468 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 2278 transitions, 54755 flow. Second operand has 37 states, 37 states have (on average 67.32432432432432) internal successors, (2491), 37 states have internal predecessors, (2491), 0 states have call successors, (0), 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-12-06 17:24:26,468 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:24:26,468 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 112 [2022-12-06 17:24:26,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:24:33,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2022-12-06 17:24:46,127 INFO L130 PetriNetUnfolder]: 4817/16685 cut-off events. [2022-12-06 17:24:46,127 INFO L131 PetriNetUnfolder]: For 230854/244336 co-relation queries the response was YES. [2022-12-06 17:24:46,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 122598 conditions, 16685 events. 4817/16685 cut-off events. For 230854/244336 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 193667 event pairs, 162 based on Foata normal form. 1201/15943 useless extension candidates. Maximal degree in co-relation 92378. Up to 7240 conditions per place. [2022-12-06 17:24:46,241 INFO L137 encePairwiseOnDemand]: 85/112 looper letters, 1255 selfloop transitions, 941 changer transitions 636/3249 dead transitions. [2022-12-06 17:24:46,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 3249 transitions, 83543 flow [2022-12-06 17:24:46,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-12-06 17:24:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-12-06 17:24:46,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 6022 transitions. [2022-12-06 17:24:46,246 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6109983766233766 [2022-12-06 17:24:46,246 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 580 predicate places. [2022-12-06 17:24:46,246 INFO L495 AbstractCegarLoop]: Abstraction has has 680 places, 3249 transitions, 83543 flow [2022-12-06 17:24:46,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 67.32432432432432) internal successors, (2491), 37 states have internal predecessors, (2491), 0 states have call successors, (0), 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-12-06 17:24:46,247 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:24:46,247 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:24:46,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-06 17:24:46,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-06 17:24:46,452 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:24:46,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:24:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 398037320, now seen corresponding path program 8 times [2022-12-06 17:24:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:24:46,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897813473] [2022-12-06 17:24:46,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:24:46,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:24:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:24:46,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 17:24:46,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:24:46,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897813473] [2022-12-06 17:24:46,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897813473] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:24:46,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16028780] [2022-12-06 17:24:46,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:24:46,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:24:46,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:24:46,994 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:24:46,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-06 17:24:47,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:24:47,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:24:47,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-06 17:24:47,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:24:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:24:48,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:24:49,156 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 17:24:49,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16028780] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:24:49,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:24:49,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 32 [2022-12-06 17:24:49,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690182072] [2022-12-06 17:24:49,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:24:49,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-06 17:24:49,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:24:49,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-06 17:24:49,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2022-12-06 17:24:49,158 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 112 [2022-12-06 17:24:49,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 3249 transitions, 83543 flow. Second operand has 32 states, 32 states have (on average 70.09375) internal successors, (2243), 32 states have internal predecessors, (2243), 0 states have call successors, (0), 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-12-06 17:24:49,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:24:49,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 112 [2022-12-06 17:24:49,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:25:01,826 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([280] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0][518], [130#true, 113#true, 1973#true, 738#true, 4744#true, 3419#true, 6164#(<= ~m~0 2147483647), 1352#true, 105#L42-2true, 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 2728#(<= ~m~0 2147483647), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 4101#true, 61#L53true, 5490#(<= ~m~0 2147483647), 6832#true, 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:25:01,827 INFO L382 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-12-06 17:25:01,827 INFO L385 tUnfolder$Statistics]: existing Event has 72 ancestors and is cut-off event [2022-12-06 17:25:01,827 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:25:01,827 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 17:25:02,281 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([280] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0][518], [130#true, 113#true, 1973#true, 37#L41-3true, 738#true, 4744#true, 3419#true, 6164#(<= ~m~0 2147483647), 1352#true, 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 2728#(<= ~m~0 2147483647), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 4101#true, 61#L53true, 5490#(<= ~m~0 2147483647), 6832#true, 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:25:02,281 INFO L382 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-12-06 17:25:02,282 INFO L385 tUnfolder$Statistics]: existing Event has 73 ancestors and is cut-off event [2022-12-06 17:25:02,282 INFO L385 tUnfolder$Statistics]: existing Event has 75 ancestors and is cut-off event [2022-12-06 17:25:02,282 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:25:03,099 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([280] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0][518], [130#true, 113#true, 1973#true, 738#true, 4744#true, 3419#true, 6164#(<= ~m~0 2147483647), 1352#true, 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 2728#(<= ~m~0 2147483647), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 4101#true, 61#L53true, 90#L41-4true, 5490#(<= ~m~0 2147483647), 6832#true, 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:25:03,099 INFO L382 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-12-06 17:25:03,099 INFO L385 tUnfolder$Statistics]: existing Event has 76 ancestors and is cut-off event [2022-12-06 17:25:03,099 INFO L385 tUnfolder$Statistics]: existing Event has 74 ancestors and is cut-off event [2022-12-06 17:25:03,099 INFO L385 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-12-06 17:25:13,870 INFO L130 PetriNetUnfolder]: 6468/22476 cut-off events. [2022-12-06 17:25:13,870 INFO L131 PetriNetUnfolder]: For 343787/360678 co-relation queries the response was YES. [2022-12-06 17:25:13,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174920 conditions, 22476 events. 6468/22476 cut-off events. For 343787/360678 co-relation queries the response was YES. Maximal size of possible extension queue 711. Compared 271199 event pairs, 213 based on Foata normal form. 1265/21113 useless extension candidates. Maximal degree in co-relation 133261. Up to 10067 conditions per place. [2022-12-06 17:25:14,065 INFO L137 encePairwiseOnDemand]: 87/112 looper letters, 1664 selfloop transitions, 1390 changer transitions 812/4286 dead transitions. [2022-12-06 17:25:14,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 770 places, 4286 transitions, 118587 flow [2022-12-06 17:25:14,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-12-06 17:25:14,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2022-12-06 17:25:14,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 6507 transitions. [2022-12-06 17:25:14,070 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6384419152276295 [2022-12-06 17:25:14,070 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 670 predicate places. [2022-12-06 17:25:14,071 INFO L495 AbstractCegarLoop]: Abstraction has has 770 places, 4286 transitions, 118587 flow [2022-12-06 17:25:14,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 70.09375) internal successors, (2243), 32 states have internal predecessors, (2243), 0 states have call successors, (0), 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-12-06 17:25:14,071 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:25:14,072 INFO L213 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-12-06 17:25:14,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-06 17:25:14,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 17:25:14,276 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:25:14,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:25:14,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1617485591, now seen corresponding path program 4 times [2022-12-06 17:25:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:25:14,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859790119] [2022-12-06 17:25:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:25:14,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:25:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:25:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:25:14,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:25:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859790119] [2022-12-06 17:25:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859790119] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:25:14,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413537858] [2022-12-06 17:25:14,575 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:25:14,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:25:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:25:14,576 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:25:14,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-06 17:25:14,637 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:25:14,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:25:14,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-06 17:25:14,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:25:15,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:25:15,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:25:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:25:15,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413537858] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:25:15,344 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:25:15,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31 [2022-12-06 17:25:15,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315713223] [2022-12-06 17:25:15,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:25:15,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-06 17:25:15,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:25:15,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-06 17:25:15,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=821, Unknown=0, NotChecked=0, Total=930 [2022-12-06 17:25:15,346 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 112 [2022-12-06 17:25:15,347 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 770 places, 4286 transitions, 118587 flow. Second operand has 31 states, 31 states have (on average 66.51612903225806) internal successors, (2062), 31 states have internal predecessors, (2062), 0 states have call successors, (0), 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-12-06 17:25:15,347 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:25:15,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 112 [2022-12-06 17:25:15,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:25:50,218 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][4246], [113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 151#(and (<= ~i1~0 ~i2~0) (<= (+ ~i1~0 1) ~n~0)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), thread1Thread1of1ForFork0InUse, 54#L76-4true, 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 7449#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (or (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< 0 ~m~0)) (< 1 ~m~0))), thread2Thread1of1ForFork1InUse, 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 4#L51-2true, 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 1951#true, 135#(<= ~n~0 ~i2~0), 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 8239#(and (<= (+ ~i1~0 1) ~i2~0) (< ~i1~0 ~n~0)), 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0))]) [2022-12-06 17:25:50,219 INFO L382 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-12-06 17:25:50,219 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:25:50,219 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:25:50,219 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:25:59,613 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][4246], [113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 151#(and (<= ~i1~0 ~i2~0) (<= (+ ~i1~0 1) ~n~0)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), thread1Thread1of1ForFork0InUse, 54#L76-4true, 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 7449#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (or (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< 0 ~m~0)) (< 1 ~m~0))), thread2Thread1of1ForFork1InUse, 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 4#L51-2true, 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 1951#true, 135#(<= ~n~0 ~i2~0), 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 8239#(and (<= (+ ~i1~0 1) ~i2~0) (< ~i1~0 ~n~0)), 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0))]) [2022-12-06 17:25:59,613 INFO L382 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-12-06 17:25:59,614 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:25:59,614 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:25:59,614 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:25:59,614 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:25:59,616 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L41-7-->L44: Formula: (= v_~i1~0_3 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3][1606], [1973#true, 113#true, 8261#(and (<= (+ ~i1~0 1) ~i2~0) (<= (+ |thread1Thread1of1ForFork0_#t~post3| 1) ~i2~0) (< ~i1~0 ~n~0)), 6018#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647)), 738#true, 4744#true, 7453#(and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (or (not (< 0 ~m~0)) (< 1 ~m~0)) (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))), 3419#true, 151#(and (<= ~i1~0 ~i2~0) (<= (+ ~i1~0 1) ~n~0)), 1352#true, 152#true, 3270#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647)), thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 4#L51-2true, 1961#true, 4101#true, 6696#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647) (or (< (+ ~j1~0 1) ~m~0) (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< ~j1~0 ~m~0)))), 35#L44true, 1951#true, 135#(<= ~n~0 ~i2~0)]) [2022-12-06 17:25:59,616 INFO L382 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-12-06 17:25:59,616 INFO L385 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-12-06 17:25:59,616 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:25:59,616 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:26:04,468 INFO L380 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([269] L41-7-->L44: Formula: (= v_~i1~0_3 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3][1606], [1973#true, 113#true, 6018#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647)), 8261#(and (<= (+ ~i1~0 1) ~i2~0) (<= (+ |thread1Thread1of1ForFork0_#t~post3| 1) ~i2~0) (< ~i1~0 ~n~0)), 738#true, 4744#true, 7453#(and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (or (not (< 0 ~m~0)) (< 1 ~m~0)) (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))), 3419#true, 1352#true, 151#(and (<= ~i1~0 ~i2~0) (<= (+ ~i1~0 1) ~n~0)), 3270#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647)), 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 4#L51-2true, 1961#true, 4101#true, 6696#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647) (or (< (+ ~j1~0 1) ~m~0) (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< ~j1~0 ~m~0)))), 35#L44true, 1951#true, 135#(<= ~n~0 ~i2~0)]) [2022-12-06 17:26:04,469 INFO L382 tUnfolder$Statistics]: this new event has 101 ancestors and is cut-off event [2022-12-06 17:26:04,469 INFO L385 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-12-06 17:26:04,469 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:26:04,469 INFO L385 tUnfolder$Statistics]: existing Event has 96 ancestors and is cut-off event [2022-12-06 17:26:04,469 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:26:21,581 INFO L130 PetriNetUnfolder]: 29944/80218 cut-off events. [2022-12-06 17:26:21,582 INFO L131 PetriNetUnfolder]: For 1373659/1403502 co-relation queries the response was YES. [2022-12-06 17:26:21,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672800 conditions, 80218 events. 29944/80218 cut-off events. For 1373659/1403502 co-relation queries the response was YES. Maximal size of possible extension queue 2287. Compared 1025741 event pairs, 1014 based on Foata normal form. 2101/73382 useless extension candidates. Maximal degree in co-relation 622308. Up to 35598 conditions per place. [2022-12-06 17:26:22,454 INFO L137 encePairwiseOnDemand]: 92/112 looper letters, 9471 selfloop transitions, 1639 changer transitions 2410/14473 dead transitions. [2022-12-06 17:26:22,454 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 856 places, 14473 transitions, 420296 flow [2022-12-06 17:26:22,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2022-12-06 17:26:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2022-12-06 17:26:22,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 5899 transitions. [2022-12-06 17:26:22,458 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6053981937602627 [2022-12-06 17:26:22,458 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 756 predicate places. [2022-12-06 17:26:22,459 INFO L495 AbstractCegarLoop]: Abstraction has has 856 places, 14473 transitions, 420296 flow [2022-12-06 17:26:22,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 66.51612903225806) internal successors, (2062), 31 states have internal predecessors, (2062), 0 states have call successors, (0), 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-12-06 17:26:22,459 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:26:22,459 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:26:22,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-06 17:26:22,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-06 17:26:22,664 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:26:22,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:26:22,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1939530226, now seen corresponding path program 9 times [2022-12-06 17:26:22,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:26:22,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756755724] [2022-12-06 17:26:22,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:26:22,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:26:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:26:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:26:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:26:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756755724] [2022-12-06 17:26:22,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756755724] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:26:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308188788] [2022-12-06 17:26:22,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:26:22,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:26:22,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:26:22,882 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:26:22,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-06 17:26:22,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 17:26:22,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:26:22,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 17:26:22,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:26:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:26:23,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:26:23,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:26:23,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308188788] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:26:23,423 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:26:23,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 21 [2022-12-06 17:26:23,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267211042] [2022-12-06 17:26:23,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:26:23,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 17:26:23,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:26:23,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 17:26:23,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2022-12-06 17:26:23,425 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 112 [2022-12-06 17:26:23,426 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 856 places, 14473 transitions, 420296 flow. Second operand has 21 states, 21 states have (on average 66.80952380952381) internal successors, (1403), 21 states have internal predecessors, (1403), 0 states have call successors, (0), 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-12-06 17:26:23,426 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:26:23,426 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 112 [2022-12-06 17:26:23,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:27:14,964 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][1363], [130#true, 113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), thread1Thread1of1ForFork0InUse, 54#L76-4true, 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 8334#true, thread2Thread1of1ForFork1InUse, 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 8201#(and (<= (+ 2 ~i1~0) ~n~0) (= ~i1~0 0) (<= (+ ~i1~0 1) ~i2~0)), 12#L52true, 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 1956#(<= (+ ~i2~0 1) ~n~0), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0)), 7214#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))))]) [2022-12-06 17:27:14,964 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-06 17:27:14,964 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:27:14,964 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:27:14,964 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:27:14,965 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([280] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0][2249], [130#true, 113#true, 1973#true, 4744#true, 3419#true, 6164#(<= ~m~0 2147483647), 1352#true, 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, 8334#true, thread2Thread1of1ForFork1InUse, 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 4101#true, 15#L42true, 61#L53true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 8201#(and (<= (+ 2 ~i1~0) ~n~0) (= ~i1~0 0) (<= (+ ~i1~0 1) ~i2~0)), 5490#(<= ~m~0 2147483647), 6832#true, 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:27:14,965 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-06 17:27:14,965 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:27:14,965 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:27:14,965 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:30:42,752 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][4591], [113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 151#(and (<= ~i1~0 ~i2~0) (<= (+ ~i1~0 1) ~n~0)), thread1Thread1of1ForFork0InUse, 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 54#L76-4true, 7449#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (or (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< 0 ~m~0)) (< 1 ~m~0))), 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), thread2Thread1of1ForFork1InUse, 8344#(<= ~n~0 ~i2~0), 4#L51-2true, 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 135#(<= ~n~0 ~i2~0), 1951#true, 8239#(and (<= (+ ~i1~0 1) ~i2~0) (< ~i1~0 ~n~0)), 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0))]) [2022-12-06 17:30:42,752 INFO L382 tUnfolder$Statistics]: this new event has 96 ancestors and is cut-off event [2022-12-06 17:30:42,752 INFO L385 tUnfolder$Statistics]: existing Event has 85 ancestors and is cut-off event [2022-12-06 17:30:42,752 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:30:42,752 INFO L385 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([280] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0][3620], [130#true, 113#true, 1973#true, 738#true, 4744#true, 3419#true, 1352#true, 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 8334#true, 2728#(<= ~m~0 2147483647), 8283#(and (<= (+ 2 ~i1~0) ~n~0) (<= (+ ~i1~0 1) ~i2~0)), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 4101#true, 61#L53true, 5490#(<= ~m~0 2147483647), 6696#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647) (or (< (+ ~j1~0 1) ~m~0) (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< ~j1~0 ~m~0)))), 22#L41-7true, 6832#true, 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:32:21,524 INFO L382 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([269] L41-7-->L44: Formula: (= v_~i1~0_3 |v_thread1Thread1of1ForFork0_#t~post3_1|) InVars {~i1~0=v_~i1~0_3} OutVars{thread1Thread1of1ForFork0_#t~post3=|v_thread1Thread1of1ForFork0_#t~post3_1|, ~i1~0=v_~i1~0_3} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post3][1895], [130#true, 1973#true, 113#true, 6018#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647)), 738#true, 7240#(or (< (+ ~j1~0 1) ~m~0) (and (<= (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1)) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1) (+ ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)))) (not (< ~j1~0 ~m~0))), 4744#true, 3419#true, 1352#true, 3270#(and (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0)) (and (<= (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1) (+ ~m~0 ~k2~0 (* (div (+ ~k1~0 1) 4294967296) 4294967296))))) (<= ~m~0 2147483647)), 152#true, thread1Thread1of1ForFork0InUse, 54#L76-4true, thread2Thread1of1ForFork1InUse, 8301#(and (<= (+ 2 ~i1~0) ~n~0) (<= (+ ~i1~0 1) ~i2~0) (<= (+ |thread1Thread1of1ForFork0_#t~post3| 1) ~i2~0) (< (+ |thread1Thread1of1ForFork0_#t~post3| 1) ~n~0)), 8334#true, 4101#true, 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 35#L44true, 12#L52true, 6718#(and (<= ~m~0 2147483647) (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (or (< (+ ~j1~0 1) ~m~0) (not (< ~j1~0 ~m~0))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))), 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:32:21,524 INFO L382 tUnfolder$Statistics]: this new event has 112 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L385 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L385 tUnfolder$Statistics]: existing Event has 101 ancestors and is cut-off event [2022-12-06 17:32:21,524 INFO L385 tUnfolder$Statistics]: existing Event has 88 ancestors and is cut-off event [2022-12-06 17:32:50,962 INFO L130 PetriNetUnfolder]: 30198/83813 cut-off events. [2022-12-06 17:32:50,962 INFO L131 PetriNetUnfolder]: For 1565185/1599129 co-relation queries the response was YES. [2022-12-06 17:32:51,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765633 conditions, 83813 events. 30198/83813 cut-off events. For 1565185/1599129 co-relation queries the response was YES. Maximal size of possible extension queue 2376. Compared 1098560 event pairs, 1243 based on Foata normal form. 2124/76790 useless extension candidates. Maximal degree in co-relation 693190. Up to 45625 conditions per place. [2022-12-06 17:32:51,909 INFO L137 encePairwiseOnDemand]: 92/112 looper letters, 12170 selfloop transitions, 412 changer transitions 3403/16938 dead transitions. [2022-12-06 17:32:51,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 16938 transitions, 530408 flow [2022-12-06 17:32:51,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-06 17:32:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2022-12-06 17:32:51,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1712 transitions. [2022-12-06 17:32:51,911 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6114285714285714 [2022-12-06 17:32:51,912 INFO L294 CegarLoopForPetriNet]: 100 programPoint places, 780 predicate places. [2022-12-06 17:32:51,912 INFO L495 AbstractCegarLoop]: Abstraction has has 880 places, 16938 transitions, 530408 flow [2022-12-06 17:32:51,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 66.80952380952381) internal successors, (1403), 21 states have internal predecessors, (1403), 0 states have call successors, (0), 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-12-06 17:32:51,912 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:32:51,912 INFO L213 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-06 17:32:51,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-06 17:32:52,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-06 17:32:52,117 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-06 17:32:52,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:32:52,118 INFO L85 PathProgramCache]: Analyzing trace with hash -326676594, now seen corresponding path program 10 times [2022-12-06 17:32:52,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:32:52,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449336559] [2022-12-06 17:32:52,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:32:52,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:32:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:32:52,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:32:52,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:32:52,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449336559] [2022-12-06 17:32:52,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449336559] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:32:52,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452282431] [2022-12-06 17:32:52,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:32:52,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:32:52,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:32:52,369 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-06 17:32:52,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-06 17:32:52,428 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:32:52,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:32:52,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-06 17:32:52,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:32:52,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:32:52,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:32:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-06 17:32:52,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452282431] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:32:52,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:32:52,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 20 [2022-12-06 17:32:52,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553235184] [2022-12-06 17:32:52,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:32:52,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-06 17:32:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:32:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-06 17:32:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2022-12-06 17:32:52,873 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 112 [2022-12-06 17:32:52,874 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 880 places, 16938 transitions, 530408 flow. Second operand has 20 states, 20 states have (on average 67.0) internal successors, (1340), 20 states have internal predecessors, (1340), 0 states have call successors, (0), 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-12-06 17:32:52,874 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:32:52,874 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 112 [2022-12-06 17:32:52,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:34:20,477 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][1655], [130#true, 113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 54#L76-4true, thread1Thread1of1ForFork0InUse, 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), thread2Thread1of1ForFork1InUse, 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 8334#true, 9211#(and (<= ~i1~0 1) (<= 1 ~i2~0)), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 8201#(and (<= (+ 2 ~i1~0) ~n~0) (= ~i1~0 0) (<= (+ ~i1~0 1) ~i2~0)), 12#L52true, 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 1956#(<= (+ ~i2~0 1) ~n~0), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0)), 7214#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))))]) [2022-12-06 17:34:20,477 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([280] L52-->L53: Formula: (= v_~k2~0_1 (+ v_~k2~0_2 v_~m~0_3)) InVars {~k2~0=v_~k2~0_2, ~m~0=v_~m~0_3} OutVars{~k2~0=v_~k2~0_1, ~m~0=v_~m~0_3} AuxVars[] AssignedVars[~k2~0][3033], [130#true, 113#true, 1973#true, 4744#true, 3419#true, 6164#(<= ~m~0 2147483647), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 1352#true, 152#true, 54#L76-4true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 8334#true, 9211#(and (<= ~i1~0 1) (<= 1 ~i2~0)), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 4101#true, 15#L42true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 61#L53true, 8201#(and (<= (+ 2 ~i1~0) ~n~0) (= ~i1~0 0) (<= (+ ~i1~0 1) ~i2~0)), 5490#(<= ~m~0 2147483647), 6832#true, 1956#(<= (+ ~i2~0 1) ~n~0)]) [2022-12-06 17:34:20,477 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L385 tUnfolder$Statistics]: existing Event has 77 ancestors and is cut-off event [2022-12-06 17:34:20,477 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:34:21,563 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][3354], [130#true, 113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 54#L76-4true, 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 8334#true, 9211#(and (<= ~i1~0 1) (<= 1 ~i2~0)), 147#(<= (+ ~i1~0 1) ~n~0), 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 8195#(and (= ~i1~0 0) (<= (+ ~i1~0 1) ~i2~0) (< ~i1~0 ~n~0)), 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 1951#true, 68#L51-1true, 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0)), 7214#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))))]) [2022-12-06 17:34:21,564 INFO L382 tUnfolder$Statistics]: this new event has 78 ancestors and is cut-off event [2022-12-06 17:34:21,564 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:34:21,564 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:34:21,564 INFO L385 tUnfolder$Statistics]: existing Event has 78 ancestors and is cut-off event [2022-12-06 17:34:53,430 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([268] L42-->L42-1: Formula: (= v_~k1~0_1 |v_thread1Thread1of1ForFork0_#t~post2_1|) InVars {~k1~0=v_~k1~0_1} OutVars{~k1~0=v_~k1~0_1, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2][4209], [113#true, 6694#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 6016#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647)), 151#(and (<= ~i1~0 ~i2~0) (<= (+ ~i1~0 1) ~n~0)), 3272#(and (or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))) (<= ~m~0 2147483647) (or (and (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0))) (< ~j1~0 ~m~0))), 54#L76-4true, thread1Thread1of1ForFork0InUse, 4477#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), thread2Thread1of1ForFork1InUse, 1699#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 8344#(<= ~n~0 ~i2~0), 4#L51-2true, 9608#(and (<= ~i1~0 1) (<= 1 ~i2~0) (<= ~n~0 ~i2~0)), 1961#true, 74#L42-1true, 1305#(and (or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)) (or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0))), 8195#(and (= ~i1~0 0) (<= (+ ~i1~0 1) ~i2~0) (< ~i1~0 ~n~0)), 3793#(or (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (< (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)) 1))) (< ~j1~0 ~m~0)), 135#(<= ~n~0 ~i2~0), 1951#true, 518#(or (and (< (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0 1)) (<= (+ (* (div (+ ~m~0 ~k2~0) 4294967296) 4294967296) ~k1~0) (+ ~m~0 ~k2~0 (* (div ~k1~0 4294967296) 4294967296)))) (< ~j1~0 ~m~0)), 5118#(or (and (< (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296) 1)) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))))) (< ~j1~0 ~m~0)), 7214#(or (< ~j1~0 ~m~0) (and (<= (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296))) (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296))) (<= (+ ~k2~0 (* (div ~k1~0 4294967296) 4294967296)) (+ ~k1~0 (* 4294967296 (div ~k2~0 4294967296)))))), 2361#(or (<= ~k1~0 (+ (* (div (+ (* (- 1) ~k2~0) ~k1~0 (* (- 1) ~m~0)) 4294967296) 4294967296) ~m~0 ~k2~0)) (< ~j1~0 ~m~0))]) [2022-12-06 17:34:53,430 INFO L382 tUnfolder$Statistics]: this new event has 79 ancestors and is cut-off event [2022-12-06 17:34:53,430 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:34:53,430 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event [2022-12-06 17:34:53,431 INFO L385 tUnfolder$Statistics]: existing Event has 79 ancestors and is cut-off event Received shutdown request... [2022-12-06 17:35:28,098 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:35:28,098 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:35:28,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-06 17:35:28,185 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-06 17:35:28,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-06 17:35:28,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:35:28,386 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 63/112 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 199301 conditions, 20627 events (7526/20626 cut-off events. For 370275/389338 co-relation queries the response was YES. Maximal size of possible extension queue 2958. Compared 277400 event pairs, 147 based on Foata normal form. 2089/23208 useless extension candidates. Maximal degree in co-relation 191209. Up to 12707 conditions per place.). [2022-12-06 17:35:28,387 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-06 17:35:28,387 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-06 17:35:28,388 INFO L458 BasicCegarLoop]: Path program histogram: [10, 4, 2, 2, 1] [2022-12-06 17:35:28,390 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:35:28,391 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:35:28,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:35:28 BasicIcfg [2022-12-06 17:35:28,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:35:28,394 INFO L158 Benchmark]: Toolchain (without parser) took 842448.10ms. Allocated memory was 248.5MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 224.1MB in the beginning and 623.7MB in the end (delta: -399.6MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2022-12-06 17:35:28,394 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 248.5MB. Free memory is still 225.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:35:28,394 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.80ms. Allocated memory is still 248.5MB. Free memory was 224.1MB in the beginning and 212.9MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-06 17:35:28,394 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.49ms. Allocated memory is still 248.5MB. Free memory was 212.9MB in the beginning and 211.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 17:35:28,395 INFO L158 Benchmark]: Boogie Preprocessor took 29.61ms. Allocated memory is still 248.5MB. Free memory was 211.5MB in the beginning and 209.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:35:28,395 INFO L158 Benchmark]: RCFGBuilder took 343.55ms. Allocated memory is still 248.5MB. Free memory was 209.9MB in the beginning and 195.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-06 17:35:28,395 INFO L158 Benchmark]: TraceAbstraction took 841827.14ms. Allocated memory was 248.5MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 195.2MB in the beginning and 623.7MB in the end (delta: -428.5MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2022-12-06 17:35:28,396 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 248.5MB. Free memory is still 225.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.80ms. Allocated memory is still 248.5MB. Free memory was 224.1MB in the beginning and 212.9MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.49ms. Allocated memory is still 248.5MB. Free memory was 212.9MB in the beginning and 211.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.61ms. Allocated memory is still 248.5MB. Free memory was 211.5MB in the beginning and 209.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 343.55ms. Allocated memory is still 248.5MB. Free memory was 209.9MB in the beginning and 195.8MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 841827.14ms. Allocated memory was 248.5MB in the beginning and 2.4GB in the end (delta: 2.1GB). Free memory was 195.2MB in the beginning and 623.7MB in the end (delta: -428.5MB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 63/112 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 199301 conditions, 20627 events (7526/20626 cut-off events. For 370275/389338 co-relation queries the response was YES. Maximal size of possible extension queue 2958. Compared 277400 event pairs, 147 based on Foata normal form. 2089/23208 useless extension candidates. Maximal degree in co-relation 191209. Up to 12707 conditions per place.). - TimeoutResultAtElement [Line: 75]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 63/112 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 199301 conditions, 20627 events (7526/20626 cut-off events. For 370275/389338 co-relation queries the response was YES. Maximal size of possible extension queue 2958. Compared 277400 event pairs, 147 based on Foata normal form. 2089/23208 useless extension candidates. Maximal degree in co-relation 191209. Up to 12707 conditions per place.). - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (20states, 63/112 universal loopers) in iteration 19,while PetriNetUnfolder was constructing finite prefix that currently has 199301 conditions, 20627 events (7526/20626 cut-off events. For 370275/389338 co-relation queries the response was YES. Maximal size of possible extension queue 2958. Compared 277400 event pairs, 147 based on Foata normal form. 2089/23208 useless extension candidates. Maximal degree in co-relation 191209. Up to 12707 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 129 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 841.7s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 764.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 11 mSolverCounterUnknown, 6029 SdHoareTripleChecker+Valid, 47.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6029 mSDsluCounter, 5778 SdHoareTripleChecker+Invalid, 45.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5153 mSDsCounter, 1048 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15477 IncrementalHoareTripleChecker+Invalid, 16536 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1048 mSolverCounterUnsat, 625 mSDtfsCounter, 15477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3487 GetRequests, 2324 SyntacticMatches, 49 SemanticMatches, 1114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28170 ImplicationChecksByTransitivity, 136.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530408occurred in iteration=18, InterpolantAutomatonStates: 800, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 71.8s InterpolantComputationTime, 2999 NumberOfCodeBlocks, 2991 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 4246 ConstructedInterpolants, 176 QuantifiedInterpolants, 55687 SizeOfPredicates, 230 NumberOfNonLiveVariables, 2748 ConjunctsInSsa, 280 ConjunctsInUnsatCore, 47 InterpolantComputations, 5 PerfectInterpolantSequences, 66/207 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown