/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/mult-flipped-dist.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:29:43,996 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:29:43,998 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:29:44,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:29:44,030 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:29:44,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:29:44,035 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:29:44,038 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:29:44,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:29:44,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:29:44,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:29:44,047 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:29:44,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:29:44,048 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:29:44,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:29:44,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:29:44,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:29:44,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:29:44,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:29:44,051 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:29:44,052 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:29:44,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:29:44,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:29:44,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:29:44,065 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:29:44,065 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:29:44,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:29:44,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:29:44,067 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:29:44,068 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:29:44,068 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:29:44,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:29:44,073 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:29:44,074 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:29:44,074 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:29:44,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:29:44,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:29:44,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:29:44,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:29:44,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:29:44,076 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:29:44,076 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:29:44,102 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:29:44,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:29:44,104 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:29:44,104 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:29:44,104 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:29:44,105 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:29:44,105 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:29:44,105 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:29:44,105 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:29:44,105 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:29:44,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:29:44,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:29:44,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:29:44,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:29:44,108 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:29:44,108 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:29:44,108 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:29:44,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:29:44,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:29:44,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:29:44,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:29:44,398 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:29:44,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c [2022-12-06 17:29:45,440 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:29:45,661 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:29:45,661 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-flipped-dist.wvr.c [2022-12-06 17:29:45,670 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881d4a77a/6d97145c2c0541d3ae92b8fea76dc64d/FLAGe1eccaa0f [2022-12-06 17:29:45,679 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/881d4a77a/6d97145c2c0541d3ae92b8fea76dc64d [2022-12-06 17:29:45,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:29:45,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:29:45,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:29:45,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:29:45,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:29:45,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@104f907c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45, skipping insertion in model container [2022-12-06 17:29:45,685 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,689 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:29:45,704 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:29:45,825 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/mult-flipped-dist.wvr.c[2135,2148] [2022-12-06 17:29:45,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:29:45,834 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:29:45,864 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/mult-flipped-dist.wvr.c[2135,2148] [2022-12-06 17:29:45,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:29:45,882 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:29:45,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45 WrapperNode [2022-12-06 17:29:45,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:29:45,884 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:29:45,884 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:29:45,884 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:29:45,888 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:29:45" (1/1) ... [2022-12-06 17:29:45,901 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:29:45" (1/1) ... [2022-12-06 17:29:45,913 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2022-12-06 17:29:45,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:29:45,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:29:45,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:29:45,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:29:45,919 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,921 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:29:45,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:29:45,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:29:45,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:29:45,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (1/1) ... [2022-12-06 17:29:45,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:29:45,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:29:45,962 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:29:45,967 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:29:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:29:45,988 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:29:45,988 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:29:45,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:29:45,989 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:29:45,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:29:45,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:29:45,990 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:29:46,059 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:29:46,061 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:29:46,234 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:29:46,239 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:29:46,239 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-06 17:29:46,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:29:46 BoogieIcfgContainer [2022-12-06 17:29:46,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:29:46,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:29:46,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:29:46,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:29:46,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:29:45" (1/3) ... [2022-12-06 17:29:46,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527ea348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:29:46, skipping insertion in model container [2022-12-06 17:29:46,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:29:45" (2/3) ... [2022-12-06 17:29:46,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@527ea348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:29:46, skipping insertion in model container [2022-12-06 17:29:46,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:29:46" (3/3) ... [2022-12-06 17:29:46,245 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-flipped-dist.wvr.c [2022-12-06 17:29:46,258 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:29:46,258 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:29:46,258 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:29:46,352 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-06 17:29:46,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 17:29:46,437 INFO L130 PetriNetUnfolder]: 7/99 cut-off events. [2022-12-06 17:29:46,437 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:29:46,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 99 events. 7/99 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2022-12-06 17:29:46,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 102 transitions, 228 flow [2022-12-06 17:29:46,449 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 89 transitions, 196 flow [2022-12-06 17:29:46,455 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:29:46,460 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;@11ea7c8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:29:46,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-06 17:29:46,482 INFO L130 PetriNetUnfolder]: 7/88 cut-off events. [2022-12-06 17:29:46,482 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-06 17:29:46,482 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:46,483 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] [2022-12-06 17:29:46,483 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:46,487 INFO L85 PathProgramCache]: Analyzing trace with hash -921312858, now seen corresponding path program 1 times [2022-12-06 17:29:46,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:46,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909007699] [2022-12-06 17:29:46,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:46,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:47,304 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:29:47,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:47,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909007699] [2022-12-06 17:29:47,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909007699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:47,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:47,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:29:47,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58310034] [2022-12-06 17:29:47,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:47,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:29:47,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:47,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:29:47,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:29:47,356 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2022-12-06 17:29:47,361 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 196 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:29:47,361 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:47,361 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2022-12-06 17:29:47,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:47,574 INFO L130 PetriNetUnfolder]: 53/319 cut-off events. [2022-12-06 17:29:47,574 INFO L131 PetriNetUnfolder]: For 74/75 co-relation queries the response was YES. [2022-12-06 17:29:47,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 467 conditions, 319 events. 53/319 cut-off events. For 74/75 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1267 event pairs, 7 based on Foata normal form. 60/342 useless extension candidates. Maximal degree in co-relation 280. Up to 52 conditions per place. [2022-12-06 17:29:47,581 INFO L137 encePairwiseOnDemand]: 88/102 looper letters, 35 selfloop transitions, 9 changer transitions 8/120 dead transitions. [2022-12-06 17:29:47,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 120 transitions, 398 flow [2022-12-06 17:29:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:29:47,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:29:47,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 869 transitions. [2022-12-06 17:29:47,596 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8519607843137255 [2022-12-06 17:29:47,600 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2022-12-06 17:29:47,600 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 120 transitions, 398 flow [2022-12-06 17:29:47,601 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:29:47,601 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:47,601 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] [2022-12-06 17:29:47,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:29:47,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -2017615783, now seen corresponding path program 1 times [2022-12-06 17:29:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:47,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696099519] [2022-12-06 17:29:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:47,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:47,752 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:29:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696099519] [2022-12-06 17:29:47,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696099519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:47,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:47,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:29:47,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312974387] [2022-12-06 17:29:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:29:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:29:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:29:47,756 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 102 [2022-12-06 17:29:47,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 120 transitions, 398 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:29:47,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:47,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 102 [2022-12-06 17:29:47,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:48,061 INFO L130 PetriNetUnfolder]: 975/2164 cut-off events. [2022-12-06 17:29:48,061 INFO L131 PetriNetUnfolder]: For 1116/1170 co-relation queries the response was YES. [2022-12-06 17:29:48,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4312 conditions, 2164 events. 975/2164 cut-off events. For 1116/1170 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 15877 event pairs, 350 based on Foata normal form. 0/1690 useless extension candidates. Maximal degree in co-relation 3837. Up to 851 conditions per place. [2022-12-06 17:29:48,079 INFO L137 encePairwiseOnDemand]: 94/102 looper letters, 62 selfloop transitions, 6 changer transitions 11/160 dead transitions. [2022-12-06 17:29:48,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 160 transitions, 732 flow [2022-12-06 17:29:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:29:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:29:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 512 transitions. [2022-12-06 17:29:48,081 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8366013071895425 [2022-12-06 17:29:48,082 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 14 predicate places. [2022-12-06 17:29:48,082 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 160 transitions, 732 flow [2022-12-06 17:29:48,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:29:48,085 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:48,085 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] [2022-12-06 17:29:48,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:29:48,089 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:48,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:48,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1952650571, now seen corresponding path program 2 times [2022-12-06 17:29:48,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744572095] [2022-12-06 17:29:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:48,225 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:29:48,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:48,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744572095] [2022-12-06 17:29:48,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744572095] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:48,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:48,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 17:29:48,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635005133] [2022-12-06 17:29:48,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:48,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 17:29:48,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:48,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 17:29:48,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 17:29:48,229 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2022-12-06 17:29:48,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 160 transitions, 732 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:48,229 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:48,229 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2022-12-06 17:29:48,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:48,610 INFO L130 PetriNetUnfolder]: 2100/4375 cut-off events. [2022-12-06 17:29:48,611 INFO L131 PetriNetUnfolder]: For 4003/4975 co-relation queries the response was YES. [2022-12-06 17:29:48,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10800 conditions, 4375 events. 2100/4375 cut-off events. For 4003/4975 co-relation queries the response was YES. Maximal size of possible extension queue 335. Compared 35719 event pairs, 604 based on Foata normal form. 55/3597 useless extension candidates. Maximal degree in co-relation 10249. Up to 1601 conditions per place. [2022-12-06 17:29:48,649 INFO L137 encePairwiseOnDemand]: 96/102 looper letters, 89 selfloop transitions, 7 changer transitions 18/206 dead transitions. [2022-12-06 17:29:48,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 206 transitions, 1214 flow [2022-12-06 17:29:48,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 17:29:48,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 17:29:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2022-12-06 17:29:48,651 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8799019607843137 [2022-12-06 17:29:48,652 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 17 predicate places. [2022-12-06 17:29:48,652 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 206 transitions, 1214 flow [2022-12-06 17:29:48,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:48,652 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:48,653 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] [2022-12-06 17:29:48,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:29:48,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:48,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1095274721, now seen corresponding path program 3 times [2022-12-06 17:29:48,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:48,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824190355] [2022-12-06 17:29:48,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:48,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:48,837 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:29:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:48,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824190355] [2022-12-06 17:29:48,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824190355] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:48,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:48,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:29:48,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398452997] [2022-12-06 17:29:48,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:48,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:29:48,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:48,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:29:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:29:48,841 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 102 [2022-12-06 17:29:48,841 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 206 transitions, 1214 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:29:48,841 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:48,841 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 102 [2022-12-06 17:29:48,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:49,398 INFO L130 PetriNetUnfolder]: 2803/6027 cut-off events. [2022-12-06 17:29:49,399 INFO L131 PetriNetUnfolder]: For 8551/10917 co-relation queries the response was YES. [2022-12-06 17:29:49,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17916 conditions, 6027 events. 2803/6027 cut-off events. For 8551/10917 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 52358 event pairs, 770 based on Foata normal form. 226/5250 useless extension candidates. Maximal degree in co-relation 12814. Up to 2240 conditions per place. [2022-12-06 17:29:49,459 INFO L137 encePairwiseOnDemand]: 94/102 looper letters, 173 selfloop transitions, 11 changer transitions 54/321 dead transitions. [2022-12-06 17:29:49,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 321 transitions, 2596 flow [2022-12-06 17:29:49,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:29:49,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:29:49,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2022-12-06 17:29:49,461 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2022-12-06 17:29:49,463 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 22 predicate places. [2022-12-06 17:29:49,463 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 321 transitions, 2596 flow [2022-12-06 17:29:49,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:29:49,463 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:49,463 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] [2022-12-06 17:29:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:29:49,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:49,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:49,464 INFO L85 PathProgramCache]: Analyzing trace with hash -720994351, now seen corresponding path program 1 times [2022-12-06 17:29:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732292649] [2022-12-06 17:29:49,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:49,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:49,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:49,587 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:29:49,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:49,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732292649] [2022-12-06 17:29:49,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732292649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:49,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:49,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:29:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773127798] [2022-12-06 17:29:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:49,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:29:49,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:49,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:29:49,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:29:49,589 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 102 [2022-12-06 17:29:49,590 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 321 transitions, 2596 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:29:49,590 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:49,590 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 102 [2022-12-06 17:29:49,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:50,247 INFO L130 PetriNetUnfolder]: 3235/7173 cut-off events. [2022-12-06 17:29:50,247 INFO L131 PetriNetUnfolder]: For 15228/23106 co-relation queries the response was YES. [2022-12-06 17:29:50,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24753 conditions, 7173 events. 3235/7173 cut-off events. For 15228/23106 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 65433 event pairs, 817 based on Foata normal form. 228/6335 useless extension candidates. Maximal degree in co-relation 18879. Up to 2408 conditions per place. [2022-12-06 17:29:50,297 INFO L137 encePairwiseOnDemand]: 94/102 looper letters, 245 selfloop transitions, 33 changer transitions 113/474 dead transitions. [2022-12-06 17:29:50,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 474 transitions, 4715 flow [2022-12-06 17:29:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:29:50,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:29:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 515 transitions. [2022-12-06 17:29:50,299 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8415032679738562 [2022-12-06 17:29:50,301 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 27 predicate places. [2022-12-06 17:29:50,301 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 474 transitions, 4715 flow [2022-12-06 17:29:50,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:29:50,301 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:50,301 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] [2022-12-06 17:29:50,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 17:29:50,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:50,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1380873849, now seen corresponding path program 4 times [2022-12-06 17:29:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:50,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233722233] [2022-12-06 17:29:50,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:50,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:50,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:50,468 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:29:50,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:50,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233722233] [2022-12-06 17:29:50,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233722233] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:50,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:50,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 17:29:50,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606793397] [2022-12-06 17:29:50,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:50,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 17:29:50,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:50,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 17:29:50,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 17:29:50,470 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2022-12-06 17:29:50,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 474 transitions, 4715 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:50,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:50,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2022-12-06 17:29:50,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:51,118 INFO L130 PetriNetUnfolder]: 3185/6789 cut-off events. [2022-12-06 17:29:51,119 INFO L131 PetriNetUnfolder]: For 20855/31165 co-relation queries the response was YES. [2022-12-06 17:29:51,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27091 conditions, 6789 events. 3185/6789 cut-off events. For 20855/31165 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 59544 event pairs, 700 based on Foata normal form. 530/6335 useless extension candidates. Maximal degree in co-relation 20921. Up to 2335 conditions per place. [2022-12-06 17:29:51,169 INFO L137 encePairwiseOnDemand]: 96/102 looper letters, 179 selfloop transitions, 30 changer transitions 123/441 dead transitions. [2022-12-06 17:29:51,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 441 transitions, 5005 flow [2022-12-06 17:29:51,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 17:29:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 17:29:51,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2022-12-06 17:29:51,170 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-12-06 17:29:51,173 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 29 predicate places. [2022-12-06 17:29:51,173 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 441 transitions, 5005 flow [2022-12-06 17:29:51,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:51,173 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:51,173 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] [2022-12-06 17:29:51,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 17:29:51,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1627561693, now seen corresponding path program 2 times [2022-12-06 17:29:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:51,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112688168] [2022-12-06 17:29:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:51,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:51,344 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:29:51,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:51,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112688168] [2022-12-06 17:29:51,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112688168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:51,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:51,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 17:29:51,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325683971] [2022-12-06 17:29:51,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:51,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 17:29:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:51,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 17:29:51,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 17:29:51,349 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2022-12-06 17:29:51,350 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 441 transitions, 5005 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:51,350 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:51,350 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2022-12-06 17:29:51,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:52,159 INFO L130 PetriNetUnfolder]: 3911/8132 cut-off events. [2022-12-06 17:29:52,159 INFO L131 PetriNetUnfolder]: For 31604/49345 co-relation queries the response was YES. [2022-12-06 17:29:52,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36191 conditions, 8132 events. 3911/8132 cut-off events. For 31604/49345 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 72131 event pairs, 856 based on Foata normal form. 233/7249 useless extension candidates. Maximal degree in co-relation 35291. Up to 2940 conditions per place. [2022-12-06 17:29:52,215 INFO L137 encePairwiseOnDemand]: 96/102 looper letters, 236 selfloop transitions, 22 changer transitions 128/487 dead transitions. [2022-12-06 17:29:52,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 487 transitions, 6241 flow [2022-12-06 17:29:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 17:29:52,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 17:29:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2022-12-06 17:29:52,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2022-12-06 17:29:52,217 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 32 predicate places. [2022-12-06 17:29:52,217 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 487 transitions, 6241 flow [2022-12-06 17:29:52,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:52,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:52,217 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] [2022-12-06 17:29:52,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 17:29:52,218 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:52,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:52,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1959829843, now seen corresponding path program 3 times [2022-12-06 17:29:52,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:52,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419069887] [2022-12-06 17:29:52,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:52,278 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:29:52,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:52,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419069887] [2022-12-06 17:29:52,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419069887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:52,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:52,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-06 17:29:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291745983] [2022-12-06 17:29:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:52,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 17:29:52,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:52,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 17:29:52,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-06 17:29:52,280 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2022-12-06 17:29:52,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 487 transitions, 6241 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:52,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:52,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2022-12-06 17:29:52,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:52,948 INFO L130 PetriNetUnfolder]: 3767/7471 cut-off events. [2022-12-06 17:29:52,948 INFO L131 PetriNetUnfolder]: For 36604/55391 co-relation queries the response was YES. [2022-12-06 17:29:52,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37480 conditions, 7471 events. 3767/7471 cut-off events. For 36604/55391 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 62371 event pairs, 773 based on Foata normal form. 264/6730 useless extension candidates. Maximal degree in co-relation 36710. Up to 2732 conditions per place. [2022-12-06 17:29:53,002 INFO L137 encePairwiseOnDemand]: 96/102 looper letters, 197 selfloop transitions, 49 changer transitions 117/454 dead transitions. [2022-12-06 17:29:53,003 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 454 transitions, 6421 flow [2022-12-06 17:29:53,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 17:29:53,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 17:29:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2022-12-06 17:29:53,004 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8774509803921569 [2022-12-06 17:29:53,004 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 34 predicate places. [2022-12-06 17:29:53,004 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 454 transitions, 6421 flow [2022-12-06 17:29:53,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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:29:53,005 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:53,005 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] [2022-12-06 17:29:53,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:29:53,005 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:53,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:53,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1312151498, now seen corresponding path program 1 times [2022-12-06 17:29:53,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:53,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135471470] [2022-12-06 17:29:53,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:53,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:53,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:29:53,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:53,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135471470] [2022-12-06 17:29:53,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135471470] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:29:53,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311748546] [2022-12-06 17:29:53,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:29:53,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:29:53,119 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:29:53,122 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:29:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:53,291 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 17:29:53,297 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:29:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:29:53,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:29:53,537 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:29:53,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311748546] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:29:53,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:29:53,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2022-12-06 17:29:53,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885577] [2022-12-06 17:29:53,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:53,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-06 17:29:53,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:53,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-06 17:29:53,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:29:53,539 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 102 [2022-12-06 17:29:53,540 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 454 transitions, 6421 flow. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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:29:53,540 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:53,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 102 [2022-12-06 17:29:53,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:54,536 INFO L130 PetriNetUnfolder]: 3932/7831 cut-off events. [2022-12-06 17:29:54,536 INFO L131 PetriNetUnfolder]: For 48744/60319 co-relation queries the response was YES. [2022-12-06 17:29:54,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43168 conditions, 7831 events. 3932/7831 cut-off events. For 48744/60319 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 65968 event pairs, 674 based on Foata normal form. 309/7171 useless extension candidates. Maximal degree in co-relation 37868. Up to 2764 conditions per place. [2022-12-06 17:29:54,602 INFO L137 encePairwiseOnDemand]: 96/102 looper letters, 253 selfloop transitions, 43 changer transitions 117/543 dead transitions. [2022-12-06 17:29:54,602 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 543 transitions, 8683 flow [2022-12-06 17:29:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-06 17:29:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-06 17:29:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 357 transitions. [2022-12-06 17:29:54,604 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-12-06 17:29:54,605 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 37 predicate places. [2022-12-06 17:29:54,605 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 543 transitions, 8683 flow [2022-12-06 17:29:54,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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:29:54,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:54,605 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] [2022-12-06 17:29:54,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-06 17:29:54,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:29:54,810 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 637222496, now seen corresponding path program 2 times [2022-12-06 17:29:54,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:54,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847848487] [2022-12-06 17:29:54,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:54,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:54,909 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:29:54,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:54,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847848487] [2022-12-06 17:29:54,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847848487] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:54,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:54,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:29:54,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375113594] [2022-12-06 17:29:54,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:54,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:29:54,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:54,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:29:54,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:29:54,910 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 102 [2022-12-06 17:29:54,911 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 543 transitions, 8683 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 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:29:54,911 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:54,911 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 102 [2022-12-06 17:29:54,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:55,952 INFO L130 PetriNetUnfolder]: 5290/10267 cut-off events. [2022-12-06 17:29:55,952 INFO L131 PetriNetUnfolder]: For 66195/85435 co-relation queries the response was YES. [2022-12-06 17:29:55,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61200 conditions, 10267 events. 5290/10267 cut-off events. For 66195/85435 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 88999 event pairs, 871 based on Foata normal form. 139/9351 useless extension candidates. Maximal degree in co-relation 59921. Up to 3556 conditions per place. [2022-12-06 17:29:56,031 INFO L137 encePairwiseOnDemand]: 94/102 looper letters, 392 selfloop transitions, 43 changer transitions 172/721 dead transitions. [2022-12-06 17:29:56,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 721 transitions, 12977 flow [2022-12-06 17:29:56,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:29:56,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:29:56,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 530 transitions. [2022-12-06 17:29:56,033 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8660130718954249 [2022-12-06 17:29:56,034 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 42 predicate places. [2022-12-06 17:29:56,034 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 721 transitions, 12977 flow [2022-12-06 17:29:56,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 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:29:56,034 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:56,034 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] [2022-12-06 17:29:56,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-06 17:29:56,035 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:56,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:56,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1897627172, now seen corresponding path program 3 times [2022-12-06 17:29:56,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:56,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575196623] [2022-12-06 17:29:56,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:56,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:56,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:56,246 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:29:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:56,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575196623] [2022-12-06 17:29:56,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575196623] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:29:56,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:29:56,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:29:56,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567388710] [2022-12-06 17:29:56,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:29:56,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:29:56,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:56,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:29:56,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:29:56,247 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 102 [2022-12-06 17:29:56,248 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 721 transitions, 12977 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 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:29:56,248 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:56,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 102 [2022-12-06 17:29:56,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:29:57,465 INFO L130 PetriNetUnfolder]: 5249/10099 cut-off events. [2022-12-06 17:29:57,465 INFO L131 PetriNetUnfolder]: For 77815/99593 co-relation queries the response was YES. [2022-12-06 17:29:57,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66496 conditions, 10099 events. 5249/10099 cut-off events. For 77815/99593 co-relation queries the response was YES. Maximal size of possible extension queue 596. Compared 86283 event pairs, 819 based on Foata normal form. 168/9276 useless extension candidates. Maximal degree in co-relation 64562. Up to 3473 conditions per place. [2022-12-06 17:29:57,623 INFO L137 encePairwiseOnDemand]: 94/102 looper letters, 408 selfloop transitions, 36 changer transitions 175/727 dead transitions. [2022-12-06 17:29:57,623 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 727 transitions, 14159 flow [2022-12-06 17:29:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:29:57,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:29:57,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2022-12-06 17:29:57,625 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2022-12-06 17:29:57,625 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 46 predicate places. [2022-12-06 17:29:57,625 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 727 transitions, 14159 flow [2022-12-06 17:29:57,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 0 states have call successors, (0), 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:29:57,625 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:29:57,626 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] [2022-12-06 17:29:57,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-06 17:29:57,626 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:29:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:29:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 757871692, now seen corresponding path program 4 times [2022-12-06 17:29:57,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:29:57,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355290708] [2022-12-06 17:29:57,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:29:57,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:29:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:29:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:29:57,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:29:57,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355290708] [2022-12-06 17:29:57,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355290708] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:29:57,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863894537] [2022-12-06 17:29:57,756 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:29:57,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:29:57,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:29:57,757 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:29:57,771 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:29:57,839 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:29:57,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:29:57,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 17:29:57,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:29:57,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:29:57,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:29:58,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:29:58,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863894537] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:29:58,031 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:29:58,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 8 [2022-12-06 17:29:58,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341410573] [2022-12-06 17:29:58,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:29:58,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:29:58,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:29:58,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:29:58,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:29:58,033 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 102 [2022-12-06 17:29:58,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 727 transitions, 14159 flow. Second operand has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 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:29:58,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:29:58,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 102 [2022-12-06 17:29:58,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:00,169 INFO L130 PetriNetUnfolder]: 8543/16411 cut-off events. [2022-12-06 17:30:00,169 INFO L131 PetriNetUnfolder]: For 151425/168152 co-relation queries the response was YES. [2022-12-06 17:30:00,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116695 conditions, 16411 events. 8543/16411 cut-off events. For 151425/168152 co-relation queries the response was YES. Maximal size of possible extension queue 972. Compared 151427 event pairs, 1143 based on Foata normal form. 265/15076 useless extension candidates. Maximal degree in co-relation 97323. Up to 5975 conditions per place. [2022-12-06 17:30:00,429 INFO L137 encePairwiseOnDemand]: 93/102 looper letters, 617 selfloop transitions, 198 changer transitions 241/1178 dead transitions. [2022-12-06 17:30:00,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1178 transitions, 25385 flow [2022-12-06 17:30:00,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-06 17:30:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-06 17:30:00,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 876 transitions. [2022-12-06 17:30:00,432 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8588235294117647 [2022-12-06 17:30:00,432 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 55 predicate places. [2022-12-06 17:30:00,432 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 1178 transitions, 25385 flow [2022-12-06 17:30:00,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 80.75) internal successors, (646), 8 states have internal predecessors, (646), 0 states have call successors, (0), 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:30:00,432 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:00,432 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] [2022-12-06 17:30:00,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-06 17:30:00,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-06 17:30:00,638 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:00,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:00,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1298273008, now seen corresponding path program 5 times [2022-12-06 17:30:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:00,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919928579] [2022-12-06 17:30:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:00,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:30:00,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919928579] [2022-12-06 17:30:00,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919928579] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106714737] [2022-12-06 17:30:00,730 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 17:30:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:00,731 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:30:00,733 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:30:00,792 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:30:00,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:30:00,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-06 17:30:00,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:00,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:30:00,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:00,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:30:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106714737] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:30:00,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:30:00,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-12-06 17:30:00,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787258543] [2022-12-06 17:30:00,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:30:00,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-06 17:30:00,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:00,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-06 17:30:00,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-12-06 17:30:00,877 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 102 [2022-12-06 17:30:00,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 1178 transitions, 25385 flow. Second operand has 10 states, 10 states have (on average 77.5) internal successors, (775), 10 states have internal predecessors, (775), 0 states have call successors, (0), 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:30:00,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:00,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 102 [2022-12-06 17:30:00,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:03,650 INFO L130 PetriNetUnfolder]: 8513/16435 cut-off events. [2022-12-06 17:30:03,650 INFO L131 PetriNetUnfolder]: For 176274/226789 co-relation queries the response was YES. [2022-12-06 17:30:03,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128974 conditions, 16435 events. 8513/16435 cut-off events. For 176274/226789 co-relation queries the response was YES. Maximal size of possible extension queue 969. Compared 152404 event pairs, 1064 based on Foata normal form. 399/15333 useless extension candidates. Maximal degree in co-relation 107803. Up to 6019 conditions per place. [2022-12-06 17:30:03,963 INFO L137 encePairwiseOnDemand]: 91/102 looper letters, 778 selfloop transitions, 172 changer transitions 231/1251 dead transitions. [2022-12-06 17:30:03,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 1251 transitions, 28804 flow [2022-12-06 17:30:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-06 17:30:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-06 17:30:03,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1031 transitions. [2022-12-06 17:30:03,982 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8423202614379085 [2022-12-06 17:30:03,982 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 66 predicate places. [2022-12-06 17:30:03,982 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 1251 transitions, 28804 flow [2022-12-06 17:30:03,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.5) internal successors, (775), 10 states have internal predecessors, (775), 0 states have call successors, (0), 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:30:03,983 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:03,983 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] [2022-12-06 17:30:04,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-06 17:30:04,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:04,193 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:04,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1634573695, now seen corresponding path program 1 times [2022-12-06 17:30:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:04,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900844427] [2022-12-06 17:30:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:04,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:04,467 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:30:04,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:04,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900844427] [2022-12-06 17:30:04,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900844427] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:04,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183819725] [2022-12-06 17:30:04,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:04,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:04,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:04,484 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:30:04,486 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:30:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:04,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:30:04,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:04,866 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:30:04,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:05,075 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:30:05,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183819725] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:30:05,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:30:05,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2022-12-06 17:30:05,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952220341] [2022-12-06 17:30:05,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:30:05,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 17:30:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:05,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 17:30:05,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2022-12-06 17:30:05,077 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-12-06 17:30:05,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 1251 transitions, 28804 flow. Second operand has 17 states, 17 states have (on average 78.52941176470588) internal successors, (1335), 17 states have internal predecessors, (1335), 0 states have call successors, (0), 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:30:05,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:05,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-12-06 17:30:05,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:09,932 INFO L130 PetriNetUnfolder]: 13486/26245 cut-off events. [2022-12-06 17:30:09,932 INFO L131 PetriNetUnfolder]: For 347965/442890 co-relation queries the response was YES. [2022-12-06 17:30:10,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207658 conditions, 26245 events. 13486/26245 cut-off events. For 347965/442890 co-relation queries the response was YES. Maximal size of possible extension queue 1378. Compared 252005 event pairs, 1693 based on Foata normal form. 398/24181 useless extension candidates. Maximal degree in co-relation 203065. Up to 10522 conditions per place. [2022-12-06 17:30:10,314 INFO L137 encePairwiseOnDemand]: 89/102 looper letters, 338 selfloop transitions, 30 changer transitions 243/1486 dead transitions. [2022-12-06 17:30:10,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 1486 transitions, 36099 flow [2022-12-06 17:30:10,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-06 17:30:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-06 17:30:10,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1768 transitions. [2022-12-06 17:30:10,317 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7878787878787878 [2022-12-06 17:30:10,317 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 87 predicate places. [2022-12-06 17:30:10,317 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 1486 transitions, 36099 flow [2022-12-06 17:30:10,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 78.52941176470588) internal successors, (1335), 17 states have internal predecessors, (1335), 0 states have call successors, (0), 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:30:10,318 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:10,318 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] [2022-12-06 17:30:10,324 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:30:10,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:10,523 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:10,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:10,524 INFO L85 PathProgramCache]: Analyzing trace with hash -722721709, now seen corresponding path program 2 times [2022-12-06 17:30:10,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:10,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874704504] [2022-12-06 17:30:10,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:10,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:10,748 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:30:10,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874704504] [2022-12-06 17:30:10,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874704504] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:10,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9738828] [2022-12-06 17:30:10,748 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:30:10,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:10,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:10,750 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:30:10,752 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:30:10,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:30:10,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:30:10,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:30:10,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:11,106 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:30:11,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:11,287 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:30:11,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9738828] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:30:11,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:30:11,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2022-12-06 17:30:11,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237768200] [2022-12-06 17:30:11,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:30:11,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 17:30:11,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:11,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 17:30:11,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-12-06 17:30:11,289 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-12-06 17:30:11,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 1486 transitions, 36099 flow. Second operand has 16 states, 16 states have (on average 78.625) internal successors, (1258), 16 states have internal predecessors, (1258), 0 states have call successors, (0), 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:30:11,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:11,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-12-06 17:30:11,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:18,024 INFO L130 PetriNetUnfolder]: 17089/33330 cut-off events. [2022-12-06 17:30:18,025 INFO L131 PetriNetUnfolder]: For 451008/495452 co-relation queries the response was YES. [2022-12-06 17:30:18,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267400 conditions, 33330 events. 17089/33330 cut-off events. For 451008/495452 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 328559 event pairs, 2377 based on Foata normal form. 735/30796 useless extension candidates. Maximal degree in co-relation 261145. Up to 13671 conditions per place. [2022-12-06 17:30:18,349 INFO L137 encePairwiseOnDemand]: 88/102 looper letters, 472 selfloop transitions, 31 changer transitions 255/1633 dead transitions. [2022-12-06 17:30:18,349 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 1633 transitions, 41335 flow [2022-12-06 17:30:18,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 17:30:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 17:30:18,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1842 transitions. [2022-12-06 17:30:18,360 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7851662404092071 [2022-12-06 17:30:18,360 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 109 predicate places. [2022-12-06 17:30:18,360 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 1633 transitions, 41335 flow [2022-12-06 17:30:18,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 78.625) internal successors, (1258), 16 states have internal predecessors, (1258), 0 states have call successors, (0), 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:30:18,361 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:18,362 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] [2022-12-06 17:30:18,370 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:30:18,565 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,SelfDestructingSolverStorable14 [2022-12-06 17:30:18,566 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:18,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:18,566 INFO L85 PathProgramCache]: Analyzing trace with hash 839371775, now seen corresponding path program 3 times [2022-12-06 17:30:18,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:18,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666001070] [2022-12-06 17:30:18,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:18,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:18,804 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:30:18,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:18,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666001070] [2022-12-06 17:30:18,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666001070] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:18,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667290397] [2022-12-06 17:30:18,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:30:18,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:18,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:18,820 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:30:18,832 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:30:18,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-06 17:30:18,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:30:18,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:30:18,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:19,178 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:30:19,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:19,349 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:30:19,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667290397] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:30:19,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:30:19,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2022-12-06 17:30:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086230310] [2022-12-06 17:30:19,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:30:19,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 17:30:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:19,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 17:30:19,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-06 17:30:19,351 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-12-06 17:30:19,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 1633 transitions, 41335 flow. Second operand has 16 states, 16 states have (on average 78.625) internal successors, (1258), 16 states have internal predecessors, (1258), 0 states have call successors, (0), 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:30:19,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:19,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-12-06 17:30:19,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:27,944 INFO L130 PetriNetUnfolder]: 20392/39914 cut-off events. [2022-12-06 17:30:27,944 INFO L131 PetriNetUnfolder]: For 549048/580835 co-relation queries the response was YES. [2022-12-06 17:30:28,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325214 conditions, 39914 events. 20392/39914 cut-off events. For 549048/580835 co-relation queries the response was YES. Maximal size of possible extension queue 1937. Compared 401764 event pairs, 3056 based on Foata normal form. 568/36382 useless extension candidates. Maximal degree in co-relation 256047. Up to 15710 conditions per place. [2022-12-06 17:30:28,373 INFO L137 encePairwiseOnDemand]: 88/102 looper letters, 557 selfloop transitions, 31 changer transitions 267/1730 dead transitions. [2022-12-06 17:30:28,374 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1730 transitions, 45228 flow [2022-12-06 17:30:28,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-06 17:30:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-06 17:30:28,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1839 transitions. [2022-12-06 17:30:28,376 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7838874680306905 [2022-12-06 17:30:28,376 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 131 predicate places. [2022-12-06 17:30:28,376 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 1730 transitions, 45228 flow [2022-12-06 17:30:28,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 78.625) internal successors, (1258), 16 states have internal predecessors, (1258), 0 states have call successors, (0), 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:30:28,377 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:28,377 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] [2022-12-06 17:30:28,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-06 17:30:28,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-06 17:30:28,581 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash -593197525, now seen corresponding path program 4 times [2022-12-06 17:30:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:28,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833615706] [2022-12-06 17:30:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:28,932 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:30:28,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:28,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833615706] [2022-12-06 17:30:28,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833615706] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:28,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269702569] [2022-12-06 17:30:28,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-06 17:30:28,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:28,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:28,948 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:30:28,956 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:30:29,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-06 17:30:29,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:30:29,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:30:29,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:29,351 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:30:29,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:29,529 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:30:29,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269702569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:30:29,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:30:29,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 17 [2022-12-06 17:30:29,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569704765] [2022-12-06 17:30:29,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:30:29,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-06 17:30:29,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:29,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-06 17:30:29,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-12-06 17:30:29,531 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-12-06 17:30:29,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1730 transitions, 45228 flow. Second operand has 17 states, 17 states have (on average 78.58823529411765) internal successors, (1336), 17 states have internal predecessors, (1336), 0 states have call successors, (0), 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:30:29,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:29,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-12-06 17:30:29,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:37,234 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([255] L59-->L58-2: Formula: (= (+ v_~x_3~0_2 v_~a~0_2 v_~b~0_2) v_~x_3~0_1) InVars {~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_2, ~b~0=v_~b~0_2} OutVars{~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_1, ~b~0=v_~b~0_2} AuxVars[] AssignedVars[~x_3~0][856], [463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 83#L75-4true, 44#L50-2true, thread2Thread1of1ForFork2InUse, 2693#true, 157#true, thread3Thread1of1ForFork0InUse, 6#L42-6true, 3229#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), thread1Thread1of1ForFork1InUse, 108#true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 65#L58-2true, 2157#true, 136#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 1622#true, 165#true, 644#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:37,234 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:30:37,234 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:37,234 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:37,234 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:37,235 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L50-2-->L50-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_7 |v_thread2Thread1of1ForFork2_#t~post2_1|) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post2][902], [652#(= thread3Thread1of1ForFork0_~i~2 0), 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 83#L75-4true, thread2Thread1of1ForFork2InUse, 2693#true, 157#true, thread3Thread1of1ForFork0InUse, 6#L42-6true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), thread1Thread1of1ForFork1InUse, 3229#true, 36#L50-3true, 108#true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 1622#true, 61#L59true, 165#true, 644#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:37,235 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:30:37,235 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:37,235 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:37,235 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:37,625 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([267] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1349], [463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 44#L50-2true, thread2Thread1of1ForFork2InUse, 2693#true, 157#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 3229#true, 108#true, 87#L76-2true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 1622#true, 61#L59true, 165#true, 644#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:37,625 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 17:30:37,626 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:37,626 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:30:37,626 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:40,527 INFO L130 PetriNetUnfolder]: 24381/47736 cut-off events. [2022-12-06 17:30:40,527 INFO L131 PetriNetUnfolder]: For 755113/802767 co-relation queries the response was YES. [2022-12-06 17:30:40,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 396079 conditions, 47736 events. 24381/47736 cut-off events. For 755113/802767 co-relation queries the response was YES. Maximal size of possible extension queue 2233. Compared 491763 event pairs, 3920 based on Foata normal form. 648/43316 useless extension candidates. Maximal degree in co-relation 384653. Up to 19081 conditions per place. [2022-12-06 17:30:41,214 INFO L137 encePairwiseOnDemand]: 90/102 looper letters, 712 selfloop transitions, 30 changer transitions 279/1896 dead transitions. [2022-12-06 17:30:41,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1896 transitions, 52281 flow [2022-12-06 17:30:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 17:30:41,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 17:30:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1690 transitions. [2022-12-06 17:30:41,216 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7889822595704948 [2022-12-06 17:30:41,216 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 151 predicate places. [2022-12-06 17:30:41,216 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 1896 transitions, 52281 flow [2022-12-06 17:30:41,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 78.58823529411765) internal successors, (1336), 17 states have internal predecessors, (1336), 0 states have call successors, (0), 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:30:41,217 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:41,217 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] [2022-12-06 17:30:41,230 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:30:41,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:41,422 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:41,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:41,422 INFO L85 PathProgramCache]: Analyzing trace with hash -794724053, now seen corresponding path program 5 times [2022-12-06 17:30:41,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:41,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818506479] [2022-12-06 17:30:41,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:41,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:41,838 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:30:41,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:41,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818506479] [2022-12-06 17:30:41,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818506479] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:41,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42774438] [2022-12-06 17:30:41,838 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-06 17:30:41,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:41,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:41,855 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:30:41,915 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:30:42,068 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:30:42,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:30:42,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:30:42,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:42,329 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:30:42,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:42,526 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:30:42,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42774438] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:30:42,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:30:42,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 9] total 16 [2022-12-06 17:30:42,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240842783] [2022-12-06 17:30:42,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:30:42,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 17:30:42,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:42,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 17:30:42,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-12-06 17:30:42,528 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-12-06 17:30:42,529 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 1896 transitions, 52281 flow. Second operand has 16 states, 16 states have (on average 78.625) internal successors, (1258), 16 states have internal predecessors, (1258), 0 states have call successors, (0), 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:30:42,529 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:42,529 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-12-06 17:30:42,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:30:51,324 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([255] L59-->L58-2: Formula: (= (+ v_~x_3~0_2 v_~a~0_2 v_~b~0_2) v_~x_3~0_1) InVars {~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_2, ~b~0=v_~b~0_2} OutVars{~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_1, ~b~0=v_~b~0_2} AuxVars[] AssignedVars[~x_3~0][860], [3762#true, 44#L50-2true, 157#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 65#L58-2true, 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 83#L75-4true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 6#L42-6true, 3229#true, thread1Thread1of1ForFork1InUse, 108#true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:51,324 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:30:51,324 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:51,324 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:51,324 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:51,325 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L50-2-->L50-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_7 |v_thread2Thread1of1ForFork2_#t~post2_1|) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post2][911], [3762#true, 157#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 61#L59true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 83#L75-4true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 6#L42-6true, 3229#true, thread1Thread1of1ForFork1InUse, 108#true, 36#L50-3true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:51,325 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:30:51,325 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:51,325 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:30:51,325 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:51,680 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([267] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1369], [3762#true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 44#L50-2true, thread2Thread1of1ForFork2InUse, 2693#true, 157#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 3229#true, 108#true, 87#L76-2true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 1622#true, 61#L59true, 165#true, 644#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:51,680 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 17:30:51,680 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:51,680 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is cut-off event [2022-12-06 17:30:51,680 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([255] L59-->L58-2: Formula: (= (+ v_~x_3~0_2 v_~a~0_2 v_~b~0_2) v_~x_3~0_1) InVars {~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_2, ~b~0=v_~b~0_2} OutVars{~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_1, ~b~0=v_~b~0_2} AuxVars[] AssignedVars[~x_3~0][860], [3762#true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 44#L50-2true, thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 157#true, thread1Thread1of1ForFork1NotInUse, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 3229#true, 108#true, 87#L76-2true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 2157#true, 65#L58-2true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 1622#true, 165#true, 644#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:52,781 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L50-2-->L50-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_7 |v_thread2Thread1of1ForFork2_#t~post2_1|) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post2][911], [3762#true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 157#true, thread1Thread1of1ForFork1NotInUse, 3229#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 108#true, 36#L50-3true, 87#L76-2true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 2157#true, 136#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 1622#true, 61#L59true, 165#true, 644#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:30:52,781 INFO L382 tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-12-06 17:30:52,781 INFO L385 tUnfolder$Statistics]: existing Event has 64 ancestors and is cut-off event [2022-12-06 17:30:55,397 INFO L130 PetriNetUnfolder]: 27219/53524 cut-off events. [2022-12-06 17:30:55,397 INFO L131 PetriNetUnfolder]: For 876850/913362 co-relation queries the response was YES. [2022-12-06 17:30:55,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 451566 conditions, 53524 events. 27219/53524 cut-off events. For 876850/913362 co-relation queries the response was YES. Maximal size of possible extension queue 2499. Compared 562148 event pairs, 4595 based on Foata normal form. 744/48472 useless extension candidates. Maximal degree in co-relation 346296. Up to 21499 conditions per place. [2022-12-06 17:30:56,149 INFO L137 encePairwiseOnDemand]: 90/102 looper letters, 819 selfloop transitions, 31 changer transitions 291/2016 dead transitions. [2022-12-06 17:30:56,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 2016 transitions, 58031 flow [2022-12-06 17:30:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-06 17:30:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2022-12-06 17:30:56,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1687 transitions. [2022-12-06 17:30:56,173 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7875816993464052 [2022-12-06 17:30:56,173 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 171 predicate places. [2022-12-06 17:30:56,173 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 2016 transitions, 58031 flow [2022-12-06 17:30:56,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 78.625) internal successors, (1258), 16 states have internal predecessors, (1258), 0 states have call successors, (0), 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:30:56,174 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:30:56,174 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] [2022-12-06 17:30:56,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-06 17:30:56,374 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,SelfDestructingSolverStorable17 [2022-12-06 17:30:56,375 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:30:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:30:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1839342745, now seen corresponding path program 6 times [2022-12-06 17:30:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:30:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831491981] [2022-12-06 17:30:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:30:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:30:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:30:56,614 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:30:56,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:30:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831491981] [2022-12-06 17:30:56,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831491981] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:56,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70552162] [2022-12-06 17:30:56,614 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-06 17:30:56,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:30:56,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:30:56,641 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:30:56,642 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:30:56,733 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2022-12-06 17:30:56,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:30:56,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-06 17:30:56,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:30:56,977 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:30:56,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:30:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-06 17:30:57,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70552162] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-06 17:30:57,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-06 17:30:57,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 15 [2022-12-06 17:30:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15753126] [2022-12-06 17:30:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:30:57,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-06 17:30:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:30:57,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-06 17:30:57,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-12-06 17:30:57,147 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 102 [2022-12-06 17:30:57,148 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 2016 transitions, 58031 flow. Second operand has 9 states, 9 states have (on average 78.22222222222223) internal successors, (704), 9 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:30:57,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:30:57,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 102 [2022-12-06 17:30:57,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:31:06,713 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([255] L59-->L58-2: Formula: (= (+ v_~x_3~0_2 v_~a~0_2 v_~b~0_2) v_~x_3~0_1) InVars {~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_2, ~b~0=v_~b~0_2} OutVars{~a~0=v_~a~0_2, ~x_3~0=v_~x_3~0_1, ~b~0=v_~b~0_2} AuxVars[] AssignedVars[~x_3~0][861], [3762#true, 44#L50-2true, 157#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 65#L58-2true, 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 4294#true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 83#L75-4true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 6#L42-6true, 3229#true, thread1Thread1of1ForFork1InUse, 108#true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:31:06,713 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L50-2-->L50-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_7 |v_thread2Thread1of1ForFork2_#t~post2_1|) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post2][912], [3762#true, 157#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 61#L59true, 4294#true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 83#L75-4true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 6#L42-6true, 3229#true, thread1Thread1of1ForFork1InUse, 108#true, 36#L50-3true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:31:06,713 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:31:06,713 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:31:07,789 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([267] thread1EXIT-->L76-2: Formula: (and (= 0 v_thread1Thread1of1ForFork1_thidvar1_4) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem13#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4)) InVars {ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem13#1=|v_ULTIMATE.start_main_#t~mem13#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][1374], [3762#true, 44#L50-2true, 157#true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 87#L76-2true, 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 61#L59true, 4294#true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, thread1Thread1of1ForFork1NotInUse, 3229#true, 108#true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:31:07,789 INFO L382 tUnfolder$Statistics]: this new event has 63 ancestors and is not cut-off event [2022-12-06 17:31:07,789 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:31:07,789 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is not cut-off event [2022-12-06 17:31:07,789 INFO L385 tUnfolder$Statistics]: existing Event has 68 ancestors and is not cut-off event [2022-12-06 17:31:08,724 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L50-2-->L50-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_7 |v_thread2Thread1of1ForFork2_#t~post2_1|) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post2][912], [3762#true, 157#true, 63#L58-3true, 47#L42-4true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 4294#true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 83#L75-4true, thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 3229#true, thread1Thread1of1ForFork1InUse, 108#true, 36#L50-3true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:31:08,725 INFO L382 tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event [2022-12-06 17:31:08,725 INFO L385 tUnfolder$Statistics]: existing Event has 58 ancestors and is cut-off event [2022-12-06 17:31:08,725 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:31:08,725 INFO L385 tUnfolder$Statistics]: existing Event has 63 ancestors and is cut-off event [2022-12-06 17:31:09,407 INFO L380 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([247] L50-2-->L50-3: Formula: (= v_thread2Thread1of1ForFork2_~i~1_7 |v_thread2Thread1of1ForFork2_#t~post2_1|) InVars {thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7} OutVars{thread2Thread1of1ForFork2_~i~1=v_thread2Thread1of1ForFork2_~i~1_7, thread2Thread1of1ForFork2_#t~post2=|v_thread2Thread1of1ForFork2_#t~post2_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork2_#t~post2][912], [3762#true, 157#true, 63#L58-3true, 134#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0), 2157#true, 928#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 147#true, 4294#true, 165#true, 1141#(and (<= (+ (* (div ~c~0 4294967296) 4294967296) 1) (+ (* (div thread3Thread1of1ForFork0_~i~2 4294967296) 4294967296) ~c~0)) (= thread3Thread1of1ForFork0_~i~2 0)), 652#(= thread3Thread1of1ForFork0_~i~2 0), 83#L75-4true, 463#(< (mod thread3Thread1of1ForFork0_~i~2 4294967296) (mod ~c~0 4294967296)), 59#L43true, thread2Thread1of1ForFork2InUse, 2693#true, thread3Thread1of1ForFork0InUse, 3229#true, thread1Thread1of1ForFork1InUse, 108#true, 36#L50-3true, 125#(= thread3Thread1of1ForFork0_~i~2 0), 136#true, 1622#true, 644#true, 163#(<= (+ (* (div ~c~0 4294967296) 4294967296) 1) ~c~0)]) [2022-12-06 17:31:09,408 INFO L382 tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event [2022-12-06 17:31:09,408 INFO L385 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-12-06 17:31:09,408 INFO L385 tUnfolder$Statistics]: existing Event has 65 ancestors and is cut-off event [2022-12-06 17:31:09,408 INFO L385 tUnfolder$Statistics]: existing Event has 60 ancestors and is cut-off event [2022-12-06 17:31:11,932 INFO L130 PetriNetUnfolder]: 29476/58125 cut-off events. [2022-12-06 17:31:11,933 INFO L131 PetriNetUnfolder]: For 1051581/1096378 co-relation queries the response was YES. [2022-12-06 17:31:12,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498822 conditions, 58125 events. 29476/58125 cut-off events. For 1051581/1096378 co-relation queries the response was YES. Maximal size of possible extension queue 2667. Compared 618915 event pairs, 5258 based on Foata normal form. 752/52444 useless extension candidates. Maximal degree in co-relation 380227. Up to 23220 conditions per place. [2022-12-06 17:31:12,757 INFO L137 encePairwiseOnDemand]: 89/102 looper letters, 888 selfloop transitions, 29 changer transitions 298/2090 dead transitions. [2022-12-06 17:31:12,757 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 2090 transitions, 62553 flow [2022-12-06 17:31:12,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-06 17:31:12,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-06 17:31:12,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1523 transitions. [2022-12-06 17:31:12,758 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7858617131062952 [2022-12-06 17:31:12,758 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 189 predicate places. [2022-12-06 17:31:12,758 INFO L495 AbstractCegarLoop]: Abstraction has has 281 places, 2090 transitions, 62553 flow [2022-12-06 17:31:12,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 78.22222222222223) internal successors, (704), 9 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-06 17:31:12,759 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:31:12,759 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] [2022-12-06 17:31:12,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-06 17:31:12,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:31:12,964 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:31:12,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:31:12,964 INFO L85 PathProgramCache]: Analyzing trace with hash 882405372, now seen corresponding path program 7 times [2022-12-06 17:31:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:31:12,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283305134] [2022-12-06 17:31:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:31:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:31:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:31:13,122 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:31:13,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:31:13,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283305134] [2022-12-06 17:31:13,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283305134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:31:13,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496692842] [2022-12-06 17:31:13,123 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-06 17:31:13,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:31:13,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:31:13,124 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:31:13,128 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:31:13,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:31:13,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 17:31:13,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:31:13,264 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:31:13,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:31:13,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:31:13,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496692842] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:31:13,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:31:13,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2022-12-06 17:31:13,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582810371] [2022-12-06 17:31:13,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:31:13,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-06 17:31:13,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:31:13,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-06 17:31:13,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-12-06 17:31:13,369 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2022-12-06 17:31:13,370 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 2090 transitions, 62553 flow. Second operand has 16 states, 16 states have (on average 77.8125) internal successors, (1245), 16 states have internal predecessors, (1245), 0 states have call successors, (0), 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:31:13,370 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:31:13,370 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2022-12-06 17:31:13,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:31:44,237 INFO L130 PetriNetUnfolder]: 49964/91886 cut-off events. [2022-12-06 17:31:44,237 INFO L131 PetriNetUnfolder]: For 1819248/1900466 co-relation queries the response was YES. [2022-12-06 17:31:44,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 844886 conditions, 91886 events. 49964/91886 cut-off events. For 1819248/1900466 co-relation queries the response was YES. Maximal size of possible extension queue 3498. Compared 944959 event pairs, 2842 based on Foata normal form. 776/82881 useless extension candidates. Maximal degree in co-relation 660903. Up to 40939 conditions per place. [2022-12-06 17:31:45,541 INFO L137 encePairwiseOnDemand]: 91/102 looper letters, 3594 selfloop transitions, 1510 changer transitions 299/5685 dead transitions. [2022-12-06 17:31:45,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 5685 transitions, 170242 flow [2022-12-06 17:31:45,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-12-06 17:31:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-12-06 17:31:45,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3863 transitions. [2022-12-06 17:31:45,549 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8057989153108052 [2022-12-06 17:31:45,549 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 235 predicate places. [2022-12-06 17:31:45,549 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 5685 transitions, 170242 flow [2022-12-06 17:31:45,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 77.8125) internal successors, (1245), 16 states have internal predecessors, (1245), 0 states have call successors, (0), 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:31:45,550 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:31:45,550 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] [2022-12-06 17:31:45,555 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:31:45,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:31:45,755 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:31:45,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:31:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1547661938, now seen corresponding path program 8 times [2022-12-06 17:31:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:31:45,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639346592] [2022-12-06 17:31:45,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:31:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:31:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:31:45,899 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:31:45,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:31:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639346592] [2022-12-06 17:31:45,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639346592] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:31:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391062531] [2022-12-06 17:31:45,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:31:45,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:31:45,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:31:45,901 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:31:45,903 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:31:45,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:31:45,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:31:45,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 17:31:45,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:31:46,063 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:31:46,064 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:31:46,168 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:31:46,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391062531] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:31:46,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:31:46,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-12-06 17:31:46,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686237979] [2022-12-06 17:31:46,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:31:46,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-06 17:31:46,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:31:46,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-06 17:31:46,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-12-06 17:31:46,170 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 102 [2022-12-06 17:31:46,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 5685 transitions, 170242 flow. Second operand has 19 states, 19 states have (on average 77.63157894736842) internal successors, (1475), 19 states have internal predecessors, (1475), 0 states have call successors, (0), 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:31:46,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:31:46,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 102 [2022-12-06 17:31:46,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:34:20,487 INFO L130 PetriNetUnfolder]: 78995/151026 cut-off events. [2022-12-06 17:34:20,488 INFO L131 PetriNetUnfolder]: For 3621871/3810372 co-relation queries the response was YES. [2022-12-06 17:34:21,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468223 conditions, 151026 events. 78995/151026 cut-off events. For 3621871/3810372 co-relation queries the response was YES. Maximal size of possible extension queue 6652. Compared 1754323 event pairs, 4639 based on Foata normal form. 3567/139325 useless extension candidates. Maximal degree in co-relation 1105648. Up to 69757 conditions per place. [2022-12-06 17:34:22,651 INFO L137 encePairwiseOnDemand]: 88/102 looper letters, 8533 selfloop transitions, 2526 changer transitions 367/11708 dead transitions. [2022-12-06 17:34:22,651 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 11708 transitions, 390286 flow [2022-12-06 17:34:22,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2022-12-06 17:34:22,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2022-12-06 17:34:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 6235 transitions. [2022-12-06 17:34:22,658 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8043085655314758 [2022-12-06 17:34:22,658 INFO L294 CegarLoopForPetriNet]: 92 programPoint places, 310 predicate places. [2022-12-06 17:34:22,658 INFO L495 AbstractCegarLoop]: Abstraction has has 402 places, 11708 transitions, 390286 flow [2022-12-06 17:34:22,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 77.63157894736842) internal successors, (1475), 19 states have internal predecessors, (1475), 0 states have call successors, (0), 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:34:22,659 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:34:22,659 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] [2022-12-06 17:34:22,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-06 17:34:22,865 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,SelfDestructingSolverStorable20 [2022-12-06 17:34:22,866 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-06 17:34:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:34:22,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1730565816, now seen corresponding path program 9 times [2022-12-06 17:34:22,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:34:22,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641594046] [2022-12-06 17:34:22,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:34:22,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:34:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:34:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:34:23,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:34:23,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641594046] [2022-12-06 17:34:23,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641594046] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:34:23,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193467089] [2022-12-06 17:34:23,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-06 17:34:23,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:34:23,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:34:23,184 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:34:23,186 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:34:23,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-06 17:34:23,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:34:23,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-06 17:34:23,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:34:23,339 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:34:23,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:34:23,455 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-06 17:34:23,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193467089] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:34:23,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:34:23,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2022-12-06 17:34:23,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249226684] [2022-12-06 17:34:23,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:34:23,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-06 17:34:23,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:34:23,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-06 17:34:23,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2022-12-06 17:34:23,457 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 102 [2022-12-06 17:34:23,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 11708 transitions, 390286 flow. Second operand has 21 states, 21 states have (on average 74.85714285714286) internal successors, (1572), 21 states have internal predecessors, (1572), 0 states have call successors, (0), 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:34:23,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:34:23,458 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 102 [2022-12-06 17:34:23,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-06 17:43:15,299 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:43:15,313 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:43:16,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-12-06 17:43:16,323 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:43:16,334 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-06 17:43:16,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-06 17:43:16,335 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-06 17:43:16,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-06 17:43:16,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-06 17:43:16,339 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-06 17:43:16,339 INFO L458 BasicCegarLoop]: Path program histogram: [9, 5, 4, 3, 1] [2022-12-06 17:43:16,353 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:43:16,353 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:43:16,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:43:16 BasicIcfg [2022-12-06 17:43:16,357 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:43:16,357 INFO L158 Benchmark]: Toolchain (without parser) took 810676.12ms. Allocated memory was 197.1MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 173.3MB in the beginning and 915.7MB in the end (delta: -742.4MB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2022-12-06 17:43:16,358 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:43:16,358 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.94ms. Allocated memory is still 197.1MB. Free memory was 173.3MB in the beginning and 162.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-12-06 17:43:16,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.38ms. Allocated memory is still 197.1MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:43:16,358 INFO L158 Benchmark]: Boogie Preprocessor took 15.91ms. Allocated memory is still 197.1MB. Free memory was 160.7MB in the beginning and 159.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-06 17:43:16,364 INFO L158 Benchmark]: RCFGBuilder took 310.79ms. Allocated memory is still 197.1MB. Free memory was 159.1MB in the beginning and 145.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-06 17:43:16,364 INFO L158 Benchmark]: TraceAbstraction took 810115.36ms. Allocated memory was 197.1MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 144.5MB in the beginning and 915.7MB in the end (delta: -771.3MB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2022-12-06 17:43:16,367 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 174.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 200.94ms. Allocated memory is still 197.1MB. Free memory was 173.3MB in the beginning and 162.3MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.38ms. Allocated memory is still 197.1MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.91ms. Allocated memory is still 197.1MB. Free memory was 160.7MB in the beginning and 159.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 310.79ms. Allocated memory is still 197.1MB. Free memory was 159.1MB in the beginning and 145.0MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 810115.36ms. Allocated memory was 197.1MB in the beginning and 6.2GB in the end (delta: 6.0GB). Free memory was 144.5MB in the beginning and 915.7MB in the end (delta: -771.3MB). Peak memory consumption was 5.3GB. 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 executing Executor. - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - 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 executing Executor. - TimeoutResultAtElement [Line: 73]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 126 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 810.0s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 797.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2775 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2775 mSDsluCounter, 2773 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2228 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7722 IncrementalHoareTripleChecker+Invalid, 7876 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 545 mSDtfsCounter, 7722 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2612 GetRequests, 2086 SyntacticMatches, 23 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14043 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=390286occurred in iteration=21, InterpolantAutomatonStates: 333, 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.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 2761 NumberOfCodeBlocks, 2761 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 3723 ConstructedInterpolants, 0 QuantifiedInterpolants, 26588 SizeOfPredicates, 83 NumberOfNonLiveVariables, 2532 ConjunctsInSsa, 168 ConjunctsInUnsatCore, 46 InterpolantComputations, 12 PerfectInterpolantSequences, 72/164 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