/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-27 22:42:06,682 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-27 22:42:06,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-27 22:42:06,709 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-27 22:42:06,709 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-27 22:42:06,711 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-27 22:42:06,714 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-27 22:42:06,718 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-27 22:42:06,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-27 22:42:06,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-27 22:42:06,725 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-27 22:42:06,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-27 22:42:06,727 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-27 22:42:06,729 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-27 22:42:06,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-27 22:42:06,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-27 22:42:06,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-27 22:42:06,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-27 22:42:06,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-27 22:42:06,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-27 22:42:06,738 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-27 22:42:06,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-27 22:42:06,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-27 22:42:06,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-27 22:42:06,743 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-27 22:42:06,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-27 22:42:06,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-27 22:42:06,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-27 22:42:06,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-27 22:42:06,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-27 22:42:06,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-27 22:42:06,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-27 22:42:06,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-27 22:42:06,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-27 22:42:06,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-27 22:42:06,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-27 22:42:06,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-27 22:42:06,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-27 22:42:06,747 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-27 22:42:06,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-27 22:42:06,747 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-27 22:42:06,750 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-VariableLbe.epf [2023-01-27 22:42:06,777 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-27 22:42:06,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-27 22:42:06,777 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-27 22:42:06,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-27 22:42:06,778 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * Use SBE=true [2023-01-27 22:42:06,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-27 22:42:06,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-27 22:42:06,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-27 22:42:06,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-27 22:42:06,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:42:06,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-27 22:42:06,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-27 22:42:06,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-27 22:42:06,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-27 22:42:06,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-27 22:42:06,781 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-27 22:42:06,781 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-27 22:42:06,781 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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 [2023-01-27 22:42:06,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-27 22:42:06,953 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-27 22:42:06,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-27 22:42:06,956 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-27 22:42:06,956 INFO L275 PluginConnector]: CDTParser initialized [2023-01-27 22:42:06,957 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2023-01-27 22:42:07,935 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-27 22:42:08,127 INFO L351 CDTParser]: Found 1 translation units. [2023-01-27 22:42:08,128 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2023-01-27 22:42:08,132 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e924537/5fb219c32ab2480fae245ac07340160a/FLAG49f3f4e7f [2023-01-27 22:42:08,541 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98e924537/5fb219c32ab2480fae245ac07340160a [2023-01-27 22:42:08,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-27 22:42:08,543 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-27 22:42:08,544 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-27 22:42:08,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-27 22:42:08,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-27 22:42:08,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19ddf19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08, skipping insertion in model container [2023-01-27 22:42:08,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-27 22:42:08,560 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-27 22:42:08,655 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2023-01-27 22:42:08,663 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:42:08,671 INFO L203 MainTranslator]: Completed pre-run [2023-01-27 22:42:08,710 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c[2696,2709] [2023-01-27 22:42:08,716 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-27 22:42:08,721 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:42:08,721 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-27 22:42:08,725 INFO L208 MainTranslator]: Completed translation [2023-01-27 22:42:08,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08 WrapperNode [2023-01-27 22:42:08,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-27 22:42:08,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-27 22:42:08,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-27 22:42:08,727 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-27 22:42:08,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,749 INFO L138 Inliner]: procedures = 24, calls = 39, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 158 [2023-01-27 22:42:08,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-27 22:42:08,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-27 22:42:08,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-27 22:42:08,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-27 22:42:08,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,758 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,758 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,766 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-27 22:42:08,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-27 22:42:08,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-27 22:42:08,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-27 22:42:08,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (1/1) ... [2023-01-27 22:42:08,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-27 22:42:08,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:08,792 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-01-27 22:42:08,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-01-27 22:42:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-27 22:42:08,814 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-27 22:42:08,814 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-27 22:42:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-27 22:42:08,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-27 22:42:08,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-27 22:42:08,816 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-27 22:42:08,877 INFO L236 CfgBuilder]: Building ICFG [2023-01-27 22:42:08,878 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-27 22:42:09,079 INFO L277 CfgBuilder]: Performing block encoding [2023-01-27 22:42:09,183 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-27 22:42:09,183 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-27 22:42:09,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:42:09 BoogieIcfgContainer [2023-01-27 22:42:09,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-27 22:42:09,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-27 22:42:09,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-27 22:42:09,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-27 22:42:09,188 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.01 10:42:08" (1/3) ... [2023-01-27 22:42:09,188 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d970018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:42:09, skipping insertion in model container [2023-01-27 22:42:09,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.01 10:42:08" (2/3) ... [2023-01-27 22:42:09,189 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d970018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.01 10:42:09, skipping insertion in model container [2023-01-27 22:42:09,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.01 10:42:09" (3/3) ... [2023-01-27 22:42:09,190 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2023-01-27 22:42:09,205 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-27 22:42:09,206 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-27 22:42:09,206 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-27 22:42:09,272 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-27 22:42:09,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 128 transitions, 272 flow [2023-01-27 22:42:09,374 INFO L130 PetriNetUnfolder]: 11/126 cut-off events. [2023-01-27 22:42:09,375 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 22:42:09,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 126 events. 11/126 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 3 conditions per place. [2023-01-27 22:42:09,380 INFO L82 GeneralOperation]: Start removeDead. Operand has 124 places, 128 transitions, 272 flow [2023-01-27 22:42:09,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 118 transitions, 248 flow [2023-01-27 22:42:09,385 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-27 22:42:09,399 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 118 transitions, 248 flow [2023-01-27 22:42:09,401 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 118 transitions, 248 flow [2023-01-27 22:42:09,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 118 transitions, 248 flow [2023-01-27 22:42:09,450 INFO L130 PetriNetUnfolder]: 11/118 cut-off events. [2023-01-27 22:42:09,450 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 22:42:09,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 11/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 93. Up to 3 conditions per place. [2023-01-27 22:42:09,451 INFO L119 LiptonReduction]: Number of co-enabled transitions 538 [2023-01-27 22:42:12,094 INFO L134 LiptonReduction]: Checked pairs total: 676 [2023-01-27 22:42:12,094 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-01-27 22:42:12,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-27 22:42:12,116 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;@7fd40fd0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-27 22:42:12,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-27 22:42:12,119 INFO L130 PetriNetUnfolder]: 3/16 cut-off events. [2023-01-27 22:42:12,119 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-27 22:42:12,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:12,120 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:12,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:12,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1821199336, now seen corresponding path program 1 times [2023-01-27 22:42:12,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:12,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8967023] [2023-01-27 22:42:12,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:12,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:12,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:12,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8967023] [2023-01-27 22:42:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8967023] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:42:12,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:42:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:42:12,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256970127] [2023-01-27 22:42:12,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:42:12,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:42:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:42:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:42:12,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 249 [2023-01-27 22:42:12,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:12,486 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 249 [2023-01-27 22:42:12,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:12,556 INFO L130 PetriNetUnfolder]: 45/87 cut-off events. [2023-01-27 22:42:12,556 INFO L131 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2023-01-27 22:42:12,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 87 events. 45/87 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 210 event pairs, 18 based on Foata normal form. 4/63 useless extension candidates. Maximal degree in co-relation 120. Up to 76 conditions per place. [2023-01-27 22:42:12,559 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 14 selfloop transitions, 2 changer transitions 5/23 dead transitions. [2023-01-27 22:42:12,559 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 106 flow [2023-01-27 22:42:12,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 22:42:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 22:42:12,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 417 transitions. [2023-01-27 22:42:12,576 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4186746987951807 [2023-01-27 22:42:12,576 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 417 transitions. [2023-01-27 22:42:12,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 417 transitions. [2023-01-27 22:42:12,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:12,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 417 transitions. [2023-01-27 22:42:12,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.25) internal successors, (417), 4 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 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) [2023-01-27 22:42:12,589 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 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) [2023-01-27 22:42:12,590 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 4 states and 417 transitions. [2023-01-27 22:42:12,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 106 flow [2023-01-27 22:42:12,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-27 22:42:12,593 INFO L231 Difference]: Finished difference. Result has 22 places, 18 transitions, 58 flow [2023-01-27 22:42:12,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=58, PETRI_PLACES=22, PETRI_TRANSITIONS=18} [2023-01-27 22:42:12,596 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 1 predicate places. [2023-01-27 22:42:12,596 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 18 transitions, 58 flow [2023-01-27 22:42:12,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:12,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:12,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-27 22:42:12,598 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:12,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash -885649661, now seen corresponding path program 1 times [2023-01-27 22:42:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422142660] [2023-01-27 22:42:12,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:42:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422142660] [2023-01-27 22:42:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422142660] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:42:12,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:42:12,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-01-27 22:42:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124406534] [2023-01-27 22:42:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:42:12,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-01-27 22:42:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-01-27 22:42:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-01-27 22:42:12,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 249 [2023-01-27 22:42:12,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 18 transitions, 58 flow. Second operand has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:12,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 249 [2023-01-27 22:42:12,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:12,929 INFO L130 PetriNetUnfolder]: 72/136 cut-off events. [2023-01-27 22:42:12,929 INFO L131 PetriNetUnfolder]: For 15/15 co-relation queries the response was YES. [2023-01-27 22:42:12,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 136 events. 72/136 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 422 event pairs, 15 based on Foata normal form. 1/96 useless extension candidates. Maximal degree in co-relation 350. Up to 77 conditions per place. [2023-01-27 22:42:12,930 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 32 selfloop transitions, 8 changer transitions 2/43 dead transitions. [2023-01-27 22:42:12,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 43 transitions, 218 flow [2023-01-27 22:42:12,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:42:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:42:12,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 648 transitions. [2023-01-27 22:42:12,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43373493975903615 [2023-01-27 22:42:12,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 648 transitions. [2023-01-27 22:42:12,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 648 transitions. [2023-01-27 22:42:12,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:12,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 648 transitions. [2023-01-27 22:42:12,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,937 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,937 INFO L175 Difference]: Start difference. First operand has 22 places, 18 transitions, 58 flow. Second operand 6 states and 648 transitions. [2023-01-27 22:42:12,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 43 transitions, 218 flow [2023-01-27 22:42:12,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 43 transitions, 214 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-27 22:42:12,938 INFO L231 Difference]: Finished difference. Result has 28 places, 24 transitions, 112 flow [2023-01-27 22:42:12,938 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=28, PETRI_TRANSITIONS=24} [2023-01-27 22:42:12,939 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 7 predicate places. [2023-01-27 22:42:12,939 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 24 transitions, 112 flow [2023-01-27 22:42:12,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:12,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:12,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:12,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-27 22:42:12,940 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:12,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 919629356, now seen corresponding path program 1 times [2023-01-27 22:42:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:12,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342556627] [2023-01-27 22:42:12,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:12,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:42:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342556627] [2023-01-27 22:42:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342556627] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-27 22:42:13,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-27 22:42:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-27 22:42:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504148466] [2023-01-27 22:42:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:42:13,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-27 22:42:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-27 22:42:13,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-27 22:42:13,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2023-01-27 22:42:13,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 24 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:13,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2023-01-27 22:42:13,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:13,064 INFO L130 PetriNetUnfolder]: 87/181 cut-off events. [2023-01-27 22:42:13,064 INFO L131 PetriNetUnfolder]: For 122/124 co-relation queries the response was YES. [2023-01-27 22:42:13,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 181 events. 87/181 cut-off events. For 122/124 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 640 event pairs, 12 based on Foata normal form. 17/170 useless extension candidates. Maximal degree in co-relation 577. Up to 109 conditions per place. [2023-01-27 22:42:13,066 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 30 selfloop transitions, 9 changer transitions 2/43 dead transitions. [2023-01-27 22:42:13,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 262 flow [2023-01-27 22:42:13,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-27 22:42:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-27 22:42:13,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 469 transitions. [2023-01-27 22:42:13,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708835341365462 [2023-01-27 22:42:13,067 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 469 transitions. [2023-01-27 22:42:13,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 469 transitions. [2023-01-27 22:42:13,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:13,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 469 transitions. [2023-01-27 22:42:13,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.25) internal successors, (469), 4 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 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) [2023-01-27 22:42:13,070 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 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) [2023-01-27 22:42:13,070 INFO L175 Difference]: Start difference. First operand has 28 places, 24 transitions, 112 flow. Second operand 4 states and 469 transitions. [2023-01-27 22:42:13,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 262 flow [2023-01-27 22:42:13,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 43 transitions, 249 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-01-27 22:42:13,071 INFO L231 Difference]: Finished difference. Result has 31 places, 27 transitions, 165 flow [2023-01-27 22:42:13,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=31, PETRI_TRANSITIONS=27} [2023-01-27 22:42:13,072 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 10 predicate places. [2023-01-27 22:42:13,072 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 27 transitions, 165 flow [2023-01-27 22:42:13,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,073 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:13,073 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:13,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-27 22:42:13,073 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:13,073 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:13,073 INFO L85 PathProgramCache]: Analyzing trace with hash -86135109, now seen corresponding path program 1 times [2023-01-27 22:42:13,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:13,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585513771] [2023-01-27 22:42:13,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:13,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:13,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:13,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585513771] [2023-01-27 22:42:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585513771] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1978576040] [2023-01-27 22:42:13,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:13,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:13,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:13,151 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:13,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-27 22:42:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:13,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-27 22:42:13,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:13,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:13,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1978576040] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:13,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:13,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-01-27 22:42:13,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013135314] [2023-01-27 22:42:13,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:13,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-27 22:42:13,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:13,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-27 22:42:13,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-01-27 22:42:13,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 249 [2023-01-27 22:42:13,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 165 flow. Second operand has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:13,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 249 [2023-01-27 22:42:13,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:13,405 INFO L130 PetriNetUnfolder]: 82/182 cut-off events. [2023-01-27 22:42:13,405 INFO L131 PetriNetUnfolder]: For 327/332 co-relation queries the response was YES. [2023-01-27 22:42:13,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 182 events. 82/182 cut-off events. For 327/332 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 606 event pairs, 36 based on Foata normal form. 13/166 useless extension candidates. Maximal degree in co-relation 733. Up to 158 conditions per place. [2023-01-27 22:42:13,407 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 23 selfloop transitions, 3 changer transitions 11/39 dead transitions. [2023-01-27 22:42:13,407 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 290 flow [2023-01-27 22:42:13,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:42:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:42:13,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-01-27 22:42:13,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40562248995983935 [2023-01-27 22:42:13,408 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-01-27 22:42:13,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-01-27 22:42:13,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:13,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-01-27 22:42:13,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,412 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 165 flow. Second operand 6 states and 606 transitions. [2023-01-27 22:42:13,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 290 flow [2023-01-27 22:42:13,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 262 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-01-27 22:42:13,414 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 167 flow [2023-01-27 22:42:13,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2023-01-27 22:42:13,414 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 16 predicate places. [2023-01-27 22:42:13,414 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 167 flow [2023-01-27 22:42:13,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 98.0) internal successors, (1176), 12 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:13,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:13,415 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:13,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-27 22:42:13,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:13,623 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:13,624 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:13,624 INFO L85 PathProgramCache]: Analyzing trace with hash -984099166, now seen corresponding path program 2 times [2023-01-27 22:42:13,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:13,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673072389] [2023-01-27 22:42:13,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:13,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:14,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673072389] [2023-01-27 22:42:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673072389] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36468068] [2023-01-27 22:42:14,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:42:14,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:14,146 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:14,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-27 22:42:14,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:42:14,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:14,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-27 22:42:14,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:14,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:14,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:42:14,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:14,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:14,568 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:14,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-01-27 22:42:14,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-01-27 22:42:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36468068] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:14,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:14,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-01-27 22:42:14,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171193756] [2023-01-27 22:42:14,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:14,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 22:42:14,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 22:42:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2023-01-27 22:42:14,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:42:14,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 167 flow. Second operand has 23 states, 23 states have (on average 81.6086956521739) internal successors, (1877), 23 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:14,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:14,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:42:14,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:16,228 INFO L130 PetriNetUnfolder]: 282/593 cut-off events. [2023-01-27 22:42:16,229 INFO L131 PetriNetUnfolder]: For 1083/1091 co-relation queries the response was YES. [2023-01-27 22:42:16,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 593 events. 282/593 cut-off events. For 1083/1091 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 2938 event pairs, 20 based on Foata normal form. 48/538 useless extension candidates. Maximal degree in co-relation 2244. Up to 247 conditions per place. [2023-01-27 22:42:16,232 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 99 selfloop transitions, 59 changer transitions 1/161 dead transitions. [2023-01-27 22:42:16,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 161 transitions, 1137 flow [2023-01-27 22:42:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-01-27 22:42:16,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-01-27 22:42:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2058 transitions. [2023-01-27 22:42:16,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34437751004016065 [2023-01-27 22:42:16,236 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2058 transitions. [2023-01-27 22:42:16,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2058 transitions. [2023-01-27 22:42:16,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:16,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2058 transitions. [2023-01-27 22:42:16,240 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 85.75) internal successors, (2058), 24 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:16,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 249.0) internal successors, (6225), 25 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:16,246 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 249.0) internal successors, (6225), 25 states have internal predecessors, (6225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:16,246 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 167 flow. Second operand 24 states and 2058 transitions. [2023-01-27 22:42:16,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 161 transitions, 1137 flow [2023-01-27 22:42:16,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 161 transitions, 1095 flow, removed 19 selfloop flow, removed 4 redundant places. [2023-01-27 22:42:16,250 INFO L231 Difference]: Finished difference. Result has 59 places, 92 transitions, 815 flow [2023-01-27 22:42:16,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=815, PETRI_PLACES=59, PETRI_TRANSITIONS=92} [2023-01-27 22:42:16,251 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 38 predicate places. [2023-01-27 22:42:16,251 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 92 transitions, 815 flow [2023-01-27 22:42:16,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 81.6086956521739) internal successors, (1877), 23 states have internal predecessors, (1877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:16,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:16,252 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:16,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:16,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:16,457 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:16,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:16,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1199743108, now seen corresponding path program 3 times [2023-01-27 22:42:16,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:16,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344473031] [2023-01-27 22:42:16,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:16,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:16,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344473031] [2023-01-27 22:42:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344473031] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451381122] [2023-01-27 22:42:16,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:42:16,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:16,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:16,818 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:16,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-27 22:42:16,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:42:16,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:16,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-27 22:42:16,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:17,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:17,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:42:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:17,168 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:17,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:17,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-01-27 22:42:17,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-01-27 22:42:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:17,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451381122] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:17,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:17,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 22 [2023-01-27 22:42:17,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041878860] [2023-01-27 22:42:17,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:17,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-27 22:42:17,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:17,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-27 22:42:17,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2023-01-27 22:42:17,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:42:17,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 92 transitions, 815 flow. Second operand has 23 states, 23 states have (on average 81.78260869565217) internal successors, (1881), 23 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:17,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:17,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:42:17,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:18,532 INFO L130 PetriNetUnfolder]: 322/653 cut-off events. [2023-01-27 22:42:18,532 INFO L131 PetriNetUnfolder]: For 1658/1661 co-relation queries the response was YES. [2023-01-27 22:42:18,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3034 conditions, 653 events. 322/653 cut-off events. For 1658/1661 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3161 event pairs, 39 based on Foata normal form. 21/570 useless extension candidates. Maximal degree in co-relation 2026. Up to 281 conditions per place. [2023-01-27 22:42:18,536 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 103 selfloop transitions, 52 changer transitions 0/157 dead transitions. [2023-01-27 22:42:18,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 157 transitions, 1487 flow [2023-01-27 22:42:18,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 22:42:18,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 22:42:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1532 transitions. [2023-01-27 22:42:18,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34181169120928157 [2023-01-27 22:42:18,539 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1532 transitions. [2023-01-27 22:42:18,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1532 transitions. [2023-01-27 22:42:18,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:18,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1532 transitions. [2023-01-27 22:42:18,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 85.11111111111111) internal successors, (1532), 18 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:18,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 249.0) internal successors, (4731), 19 states have internal predecessors, (4731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:18,547 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 249.0) internal successors, (4731), 19 states have internal predecessors, (4731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:18,547 INFO L175 Difference]: Start difference. First operand has 59 places, 92 transitions, 815 flow. Second operand 18 states and 1532 transitions. [2023-01-27 22:42:18,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 157 transitions, 1487 flow [2023-01-27 22:42:18,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 157 transitions, 1199 flow, removed 140 selfloop flow, removed 5 redundant places. [2023-01-27 22:42:18,554 INFO L231 Difference]: Finished difference. Result has 77 places, 108 transitions, 910 flow [2023-01-27 22:42:18,554 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=910, PETRI_PLACES=77, PETRI_TRANSITIONS=108} [2023-01-27 22:42:18,555 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 56 predicate places. [2023-01-27 22:42:18,555 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 108 transitions, 910 flow [2023-01-27 22:42:18,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 81.78260869565217) internal successors, (1881), 23 states have internal predecessors, (1881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:18,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:18,556 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:18,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:18,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:18,760 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:18,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:18,760 INFO L85 PathProgramCache]: Analyzing trace with hash -677539897, now seen corresponding path program 1 times [2023-01-27 22:42:18,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:18,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83178082] [2023-01-27 22:42:18,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:18,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83178082] [2023-01-27 22:42:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83178082] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944972611] [2023-01-27 22:42:19,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:19,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:19,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:19,162 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:19,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-27 22:42:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:19,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjunts are in the unsatisfiable core [2023-01-27 22:42:19,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:19,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:42:19,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:19,471 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:19,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 29 [2023-01-27 22:42:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:42:19,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944972611] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:19,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:19,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 17 [2023-01-27 22:42:19,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045433172] [2023-01-27 22:42:19,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:19,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-27 22:42:19,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-27 22:42:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-01-27 22:42:19,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 249 [2023-01-27 22:42:19,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 108 transitions, 910 flow. Second operand has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:19,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:19,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 249 [2023-01-27 22:42:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:19,980 INFO L130 PetriNetUnfolder]: 357/723 cut-off events. [2023-01-27 22:42:19,981 INFO L131 PetriNetUnfolder]: For 1922/1922 co-relation queries the response was YES. [2023-01-27 22:42:19,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3229 conditions, 723 events. 357/723 cut-off events. For 1922/1922 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3616 event pairs, 51 based on Foata normal form. 10/668 useless extension candidates. Maximal degree in co-relation 3123. Up to 591 conditions per place. [2023-01-27 22:42:19,984 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 122 selfloop transitions, 30 changer transitions 4/157 dead transitions. [2023-01-27 22:42:19,984 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 157 transitions, 1466 flow [2023-01-27 22:42:19,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-01-27 22:42:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-01-27 22:42:19,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1171 transitions. [2023-01-27 22:42:19,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.313520749665328 [2023-01-27 22:42:19,987 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1171 transitions. [2023-01-27 22:42:19,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1171 transitions. [2023-01-27 22:42:19,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:19,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1171 transitions. [2023-01-27 22:42:19,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 78.06666666666666) internal successors, (1171), 15 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:19,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 249.0) internal successors, (3984), 16 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:19,993 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 249.0) internal successors, (3984), 16 states have internal predecessors, (3984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:19,993 INFO L175 Difference]: Start difference. First operand has 77 places, 108 transitions, 910 flow. Second operand 15 states and 1171 transitions. [2023-01-27 22:42:19,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 157 transitions, 1466 flow [2023-01-27 22:42:19,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 157 transitions, 1410 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-01-27 22:42:20,001 INFO L231 Difference]: Finished difference. Result has 86 places, 122 transitions, 1105 flow [2023-01-27 22:42:20,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1105, PETRI_PLACES=86, PETRI_TRANSITIONS=122} [2023-01-27 22:42:20,002 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 65 predicate places. [2023-01-27 22:42:20,002 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 122 transitions, 1105 flow [2023-01-27 22:42:20,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 75.10526315789474) internal successors, (1427), 19 states have internal predecessors, (1427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:20,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:20,003 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:20,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-01-27 22:42:20,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:20,207 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:20,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash 232462075, now seen corresponding path program 4 times [2023-01-27 22:42:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726675986] [2023-01-27 22:42:20,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726675986] [2023-01-27 22:42:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726675986] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670447003] [2023-01-27 22:42:21,015 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:42:21,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:21,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:21,017 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:21,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-27 22:42:21,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:42:21,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:21,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-01-27 22:42:21,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:21,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:21,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:42:21,223 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:42:21,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:21,271 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:21,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-01-27 22:42:21,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-01-27 22:42:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:42:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670447003] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-27 22:42:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 6] total 18 [2023-01-27 22:42:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627099233] [2023-01-27 22:42:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-27 22:42:21,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-27 22:42:21,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:21,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-27 22:42:21,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=294, Unknown=4, NotChecked=0, Total=342 [2023-01-27 22:42:21,331 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 249 [2023-01-27 22:42:21,331 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 122 transitions, 1105 flow. Second operand has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:21,331 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:21,331 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 249 [2023-01-27 22:42:21,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:21,478 INFO L130 PetriNetUnfolder]: 354/698 cut-off events. [2023-01-27 22:42:21,478 INFO L131 PetriNetUnfolder]: For 2563/2573 co-relation queries the response was YES. [2023-01-27 22:42:21,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3354 conditions, 698 events. 354/698 cut-off events. For 2563/2573 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3335 event pairs, 30 based on Foata normal form. 18/666 useless extension candidates. Maximal degree in co-relation 3031. Up to 445 conditions per place. [2023-01-27 22:42:21,482 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 113 selfloop transitions, 32 changer transitions 0/148 dead transitions. [2023-01-27 22:42:21,482 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 148 transitions, 1548 flow [2023-01-27 22:42:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-27 22:42:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-27 22:42:21,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 494 transitions. [2023-01-27 22:42:21,483 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967871485943775 [2023-01-27 22:42:21,483 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 494 transitions. [2023-01-27 22:42:21,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 494 transitions. [2023-01-27 22:42:21,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:21,484 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 494 transitions. [2023-01-27 22:42:21,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:21,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:21,486 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:21,486 INFO L175 Difference]: Start difference. First operand has 86 places, 122 transitions, 1105 flow. Second operand 5 states and 494 transitions. [2023-01-27 22:42:21,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 148 transitions, 1548 flow [2023-01-27 22:42:21,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 148 transitions, 1473 flow, removed 23 selfloop flow, removed 6 redundant places. [2023-01-27 22:42:21,495 INFO L231 Difference]: Finished difference. Result has 86 places, 123 transitions, 1175 flow [2023-01-27 22:42:21,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1175, PETRI_PLACES=86, PETRI_TRANSITIONS=123} [2023-01-27 22:42:21,496 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 65 predicate places. [2023-01-27 22:42:21,496 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 123 transitions, 1175 flow [2023-01-27 22:42:21,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 94.33333333333333) internal successors, (566), 6 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:21,496 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:21,496 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:21,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-01-27 22:42:21,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:21,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:21,701 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash -496561753, now seen corresponding path program 2 times [2023-01-27 22:42:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:21,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061583827] [2023-01-27 22:42:21,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:21,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:22,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:22,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061583827] [2023-01-27 22:42:22,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061583827] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:22,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617640322] [2023-01-27 22:42:22,154 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:42:22,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:22,157 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:22,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-27 22:42:22,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:42:22,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:22,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 40 conjunts are in the unsatisfiable core [2023-01-27 22:42:22,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:22,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2023-01-27 22:42:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:22,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:22,557 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:22,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 26 [2023-01-27 22:42:22,813 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:22,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617640322] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:22,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:22,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-01-27 22:42:22,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534471214] [2023-01-27 22:42:22,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:22,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 22:42:22,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:22,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 22:42:22,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-01-27 22:42:22,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 249 [2023-01-27 22:42:22,820 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 123 transitions, 1175 flow. Second operand has 26 states, 26 states have (on average 74.8076923076923) internal successors, (1945), 26 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:22,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:22,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 249 [2023-01-27 22:42:22,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:24,279 INFO L130 PetriNetUnfolder]: 656/1307 cut-off events. [2023-01-27 22:42:24,279 INFO L131 PetriNetUnfolder]: For 5494/5494 co-relation queries the response was YES. [2023-01-27 22:42:24,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6335 conditions, 1307 events. 656/1307 cut-off events. For 5494/5494 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 7763 event pairs, 41 based on Foata normal form. 13/1259 useless extension candidates. Maximal degree in co-relation 5640. Up to 648 conditions per place. [2023-01-27 22:42:24,286 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 185 selfloop transitions, 110 changer transitions 36/332 dead transitions. [2023-01-27 22:42:24,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 332 transitions, 3248 flow [2023-01-27 22:42:24,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-27 22:42:24,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-27 22:42:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2520 transitions. [2023-01-27 22:42:24,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31626506024096385 [2023-01-27 22:42:24,292 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2520 transitions. [2023-01-27 22:42:24,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2520 transitions. [2023-01-27 22:42:24,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:24,294 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2520 transitions. [2023-01-27 22:42:24,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 78.75) internal successors, (2520), 32 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:24,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 249.0) internal successors, (8217), 33 states have internal predecessors, (8217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:24,306 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 249.0) internal successors, (8217), 33 states have internal predecessors, (8217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:24,306 INFO L175 Difference]: Start difference. First operand has 86 places, 123 transitions, 1175 flow. Second operand 32 states and 2520 transitions. [2023-01-27 22:42:24,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 332 transitions, 3248 flow [2023-01-27 22:42:24,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 332 transitions, 3169 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-01-27 22:42:24,329 INFO L231 Difference]: Finished difference. Result has 134 places, 203 transitions, 2392 flow [2023-01-27 22:42:24,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1112, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=2392, PETRI_PLACES=134, PETRI_TRANSITIONS=203} [2023-01-27 22:42:24,330 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 113 predicate places. [2023-01-27 22:42:24,330 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 203 transitions, 2392 flow [2023-01-27 22:42:24,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 74.8076923076923) internal successors, (1945), 26 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:24,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:24,331 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:24,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:24,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:24,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:24,536 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash -840816843, now seen corresponding path program 3 times [2023-01-27 22:42:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:24,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491180298] [2023-01-27 22:42:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:24,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:25,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:25,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491180298] [2023-01-27 22:42:25,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491180298] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:25,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734616782] [2023-01-27 22:42:25,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:42:25,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:25,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:25,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:25,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-27 22:42:25,121 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:42:25,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:25,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 48 conjunts are in the unsatisfiable core [2023-01-27 22:42:25,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:25,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:25,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 22:42:25,435 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:42:25,437 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:25,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2023-01-27 22:42:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:25,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:25,648 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:25,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2023-01-27 22:42:25,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2023-01-27 22:42:25,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2023-01-27 22:42:25,890 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:25,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734616782] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:25,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:25,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 26 [2023-01-27 22:42:25,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375289466] [2023-01-27 22:42:25,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:25,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-27 22:42:25,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:25,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-27 22:42:25,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=636, Unknown=1, NotChecked=0, Total=756 [2023-01-27 22:42:25,894 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:42:25,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 203 transitions, 2392 flow. Second operand has 28 states, 28 states have (on average 70.71428571428571) internal successors, (1980), 28 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:25,896 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:25,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:42:25,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:33,241 INFO L130 PetriNetUnfolder]: 724/1451 cut-off events. [2023-01-27 22:42:33,242 INFO L131 PetriNetUnfolder]: For 9529/9529 co-relation queries the response was YES. [2023-01-27 22:42:33,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8283 conditions, 1451 events. 724/1451 cut-off events. For 9529/9529 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 8872 event pairs, 46 based on Foata normal form. 9/1429 useless extension candidates. Maximal degree in co-relation 8184. Up to 902 conditions per place. [2023-01-27 22:42:33,251 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 184 selfloop transitions, 116 changer transitions 7/308 dead transitions. [2023-01-27 22:42:33,251 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 308 transitions, 3873 flow [2023-01-27 22:42:33,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-01-27 22:42:33,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-01-27 22:42:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1633 transitions. [2023-01-27 22:42:33,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29810149689667764 [2023-01-27 22:42:33,255 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1633 transitions. [2023-01-27 22:42:33,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1633 transitions. [2023-01-27 22:42:33,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:33,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1633 transitions. [2023-01-27 22:42:33,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 74.22727272727273) internal successors, (1633), 22 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:33,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 249.0) internal successors, (5727), 23 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:33,274 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 249.0) internal successors, (5727), 23 states have internal predecessors, (5727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:33,274 INFO L175 Difference]: Start difference. First operand has 134 places, 203 transitions, 2392 flow. Second operand 22 states and 1633 transitions. [2023-01-27 22:42:33,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 308 transitions, 3873 flow [2023-01-27 22:42:33,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 308 transitions, 3651 flow, removed 94 selfloop flow, removed 13 redundant places. [2023-01-27 22:42:33,326 INFO L231 Difference]: Finished difference. Result has 148 places, 246 transitions, 3162 flow [2023-01-27 22:42:33,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2213, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=3162, PETRI_PLACES=148, PETRI_TRANSITIONS=246} [2023-01-27 22:42:33,327 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 127 predicate places. [2023-01-27 22:42:33,328 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 246 transitions, 3162 flow [2023-01-27 22:42:33,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 70.71428571428571) internal successors, (1980), 28 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:33,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:33,328 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:33,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:33,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:33,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:33,533 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:33,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1371086443, now seen corresponding path program 4 times [2023-01-27 22:42:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:33,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923049526] [2023-01-27 22:42:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:34,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923049526] [2023-01-27 22:42:34,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923049526] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143081731] [2023-01-27 22:42:34,088 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:42:34,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:34,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:34,089 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:34,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-27 22:42:34,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:42:34,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:34,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-27 22:42:34,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:34,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:34,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:42:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:42:34,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:34,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:34,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2023-01-27 22:42:34,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 45 [2023-01-27 22:42:34,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:42:34,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143081731] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:34,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:34,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2023-01-27 22:42:34,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150385212] [2023-01-27 22:42:34,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:34,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 22:42:34,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:34,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 22:42:34,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=578, Unknown=1, NotChecked=0, Total=650 [2023-01-27 22:42:34,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:42:34,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 246 transitions, 3162 flow. Second operand has 26 states, 26 states have (on average 70.76923076923077) internal successors, (1840), 26 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:34,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:34,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:42:34,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:35,429 INFO L130 PetriNetUnfolder]: 740/1503 cut-off events. [2023-01-27 22:42:35,430 INFO L131 PetriNetUnfolder]: For 10486/10486 co-relation queries the response was YES. [2023-01-27 22:42:35,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8968 conditions, 1503 events. 740/1503 cut-off events. For 10486/10486 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 9349 event pairs, 128 based on Foata normal form. 2/1475 useless extension candidates. Maximal degree in co-relation 8719. Up to 1212 conditions per place. [2023-01-27 22:42:35,441 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 237 selfloop transitions, 42 changer transitions 16/296 dead transitions. [2023-01-27 22:42:35,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 296 transitions, 4072 flow [2023-01-27 22:42:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-01-27 22:42:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-01-27 22:42:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1186 transitions. [2023-01-27 22:42:35,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2976907630522088 [2023-01-27 22:42:35,443 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1186 transitions. [2023-01-27 22:42:35,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1186 transitions. [2023-01-27 22:42:35,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:35,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1186 transitions. [2023-01-27 22:42:35,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 74.125) internal successors, (1186), 16 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:35,447 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 249.0) internal successors, (4233), 17 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:35,447 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 249.0) internal successors, (4233), 17 states have internal predecessors, (4233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:35,447 INFO L175 Difference]: Start difference. First operand has 148 places, 246 transitions, 3162 flow. Second operand 16 states and 1186 transitions. [2023-01-27 22:42:35,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 296 transitions, 4072 flow [2023-01-27 22:42:35,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 296 transitions, 3984 flow, removed 31 selfloop flow, removed 9 redundant places. [2023-01-27 22:42:35,505 INFO L231 Difference]: Finished difference. Result has 158 places, 251 transitions, 3291 flow [2023-01-27 22:42:35,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3084, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=3291, PETRI_PLACES=158, PETRI_TRANSITIONS=251} [2023-01-27 22:42:35,506 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 137 predicate places. [2023-01-27 22:42:35,506 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 251 transitions, 3291 flow [2023-01-27 22:42:35,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 70.76923076923077) internal successors, (1840), 26 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:35,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:35,507 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:35,513 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:35,711 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,SelfDestructingSolverStorable10 [2023-01-27 22:42:35,711 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:35,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash -630894816, now seen corresponding path program 5 times [2023-01-27 22:42:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312695462] [2023-01-27 22:42:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:35,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:35,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:42:35,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312695462] [2023-01-27 22:42:35,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312695462] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1749402020] [2023-01-27 22:42:35,801 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:42:35,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:35,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:35,822 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:35,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-27 22:42:35,889 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:42:35,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:35,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-27 22:42:35,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:35,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:35,992 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:36,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1749402020] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:36,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:36,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2023-01-27 22:42:36,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424360346] [2023-01-27 22:42:36,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:36,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-27 22:42:36,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:36,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-27 22:42:36,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-01-27 22:42:36,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 249 [2023-01-27 22:42:36,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 251 transitions, 3291 flow. Second operand has 20 states, 20 states have (on average 96.3) internal successors, (1926), 20 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:36,147 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:36,147 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 249 [2023-01-27 22:42:36,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:36,549 INFO L130 PetriNetUnfolder]: 672/1440 cut-off events. [2023-01-27 22:42:36,549 INFO L131 PetriNetUnfolder]: For 13448/13456 co-relation queries the response was YES. [2023-01-27 22:42:36,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8584 conditions, 1440 events. 672/1440 cut-off events. For 13448/13456 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 9484 event pairs, 30 based on Foata normal form. 230/1637 useless extension candidates. Maximal degree in co-relation 8484. Up to 494 conditions per place. [2023-01-27 22:42:36,558 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 131 selfloop transitions, 68 changer transitions 99/302 dead transitions. [2023-01-27 22:42:36,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 302 transitions, 4174 flow [2023-01-27 22:42:36,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 22:42:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-01-27 22:42:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1405 transitions. [2023-01-27 22:42:36,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40304073436603555 [2023-01-27 22:42:36,560 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1405 transitions. [2023-01-27 22:42:36,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1405 transitions. [2023-01-27 22:42:36,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:36,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1405 transitions. [2023-01-27 22:42:36,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 100.35714285714286) internal successors, (1405), 14 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:36,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 249.0) internal successors, (3735), 15 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:36,564 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 249.0) internal successors, (3735), 15 states have internal predecessors, (3735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:36,564 INFO L175 Difference]: Start difference. First operand has 158 places, 251 transitions, 3291 flow. Second operand 14 states and 1405 transitions. [2023-01-27 22:42:36,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 302 transitions, 4174 flow [2023-01-27 22:42:36,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 302 transitions, 3950 flow, removed 64 selfloop flow, removed 15 redundant places. [2023-01-27 22:42:36,624 INFO L231 Difference]: Finished difference. Result has 154 places, 157 transitions, 2031 flow [2023-01-27 22:42:36,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2693, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=2031, PETRI_PLACES=154, PETRI_TRANSITIONS=157} [2023-01-27 22:42:36,625 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 133 predicate places. [2023-01-27 22:42:36,625 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 157 transitions, 2031 flow [2023-01-27 22:42:36,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 96.3) internal successors, (1926), 20 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:36,626 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:36,626 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:36,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:36,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:36,833 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:36,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:36,834 INFO L85 PathProgramCache]: Analyzing trace with hash -557386816, now seen corresponding path program 6 times [2023-01-27 22:42:36,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:36,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107951884] [2023-01-27 22:42:36,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:36,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:37,557 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107951884] [2023-01-27 22:42:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107951884] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263132637] [2023-01-27 22:42:37,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:42:37,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:37,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:37,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:37,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-27 22:42:37,671 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:42:37,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:37,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-27 22:42:37,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:37,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:37,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:42:37,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:42:37,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:38,018 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~q_front~0 4) c_~q~0.offset))) (and (forall ((v_ArrVal_393 (Array Int Int))) (<= c_~N~0 (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_393) c_~q~0.base) .cse0)))) (forall ((v_ArrVal_393 (Array Int Int))) (< (+ c_~s~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_393) c_~q~0.base) .cse0)) (+ c_~N~0 1))))) is different from false [2023-01-27 22:42:38,071 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:38,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 86 treesize of output 70 [2023-01-27 22:42:38,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2023-01-27 22:42:38,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2023-01-27 22:42:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:42:38,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263132637] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:38,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:38,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 7] total 26 [2023-01-27 22:42:38,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774276898] [2023-01-27 22:42:38,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:38,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-27 22:42:38,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:38,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-27 22:42:38,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=623, Unknown=1, NotChecked=50, Total=756 [2023-01-27 22:42:38,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:42:38,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 157 transitions, 2031 flow. Second operand has 28 states, 28 states have (on average 70.67857142857143) internal successors, (1979), 28 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:38,214 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:38,214 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:42:38,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:39,457 INFO L130 PetriNetUnfolder]: 420/936 cut-off events. [2023-01-27 22:42:39,457 INFO L131 PetriNetUnfolder]: For 7503/7503 co-relation queries the response was YES. [2023-01-27 22:42:39,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5835 conditions, 936 events. 420/936 cut-off events. For 7503/7503 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 5510 event pairs, 60 based on Foata normal form. 2/909 useless extension candidates. Maximal degree in co-relation 5780. Up to 732 conditions per place. [2023-01-27 22:42:39,463 INFO L137 encePairwiseOnDemand]: 237/249 looper letters, 150 selfloop transitions, 29 changer transitions 35/215 dead transitions. [2023-01-27 22:42:39,463 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 215 transitions, 2898 flow [2023-01-27 22:42:39,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-01-27 22:42:39,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-01-27 22:42:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1470 transitions. [2023-01-27 22:42:39,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29518072289156627 [2023-01-27 22:42:39,467 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1470 transitions. [2023-01-27 22:42:39,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1470 transitions. [2023-01-27 22:42:39,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:39,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1470 transitions. [2023-01-27 22:42:39,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 73.5) internal successors, (1470), 20 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:39,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:39,473 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:39,473 INFO L175 Difference]: Start difference. First operand has 154 places, 157 transitions, 2031 flow. Second operand 20 states and 1470 transitions. [2023-01-27 22:42:39,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 215 transitions, 2898 flow [2023-01-27 22:42:39,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 215 transitions, 2620 flow, removed 100 selfloop flow, removed 22 redundant places. [2023-01-27 22:42:39,504 INFO L231 Difference]: Finished difference. Result has 136 places, 156 transitions, 1880 flow [2023-01-27 22:42:39,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1880, PETRI_PLACES=136, PETRI_TRANSITIONS=156} [2023-01-27 22:42:39,505 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 115 predicate places. [2023-01-27 22:42:39,506 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 156 transitions, 1880 flow [2023-01-27 22:42:39,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 70.67857142857143) internal successors, (1979), 28 states have internal predecessors, (1979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:39,506 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:39,506 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:39,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:39,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-27 22:42:39,711 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:39,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:39,711 INFO L85 PathProgramCache]: Analyzing trace with hash -565204940, now seen corresponding path program 7 times [2023-01-27 22:42:39,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:39,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477860648] [2023-01-27 22:42:39,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:39,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:40,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477860648] [2023-01-27 22:42:40,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477860648] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:40,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930872889] [2023-01-27 22:42:40,233 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:42:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:40,234 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:40,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-27 22:42:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:40,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-27 22:42:40,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:40,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:40,675 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 22:42:40,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-01-27 22:42:41,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930872889] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:41,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:41,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-01-27 22:42:41,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532281457] [2023-01-27 22:42:41,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:41,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:42:41,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:41,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:42:41,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=776, Unknown=0, NotChecked=0, Total=930 [2023-01-27 22:42:41,029 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 249 [2023-01-27 22:42:41,030 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 156 transitions, 1880 flow. Second operand has 31 states, 31 states have (on average 76.64516129032258) internal successors, (2376), 31 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:41,030 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:41,030 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 249 [2023-01-27 22:42:41,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:43,416 INFO L130 PetriNetUnfolder]: 812/1715 cut-off events. [2023-01-27 22:42:43,417 INFO L131 PetriNetUnfolder]: For 9754/9754 co-relation queries the response was YES. [2023-01-27 22:42:43,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10231 conditions, 1715 events. 812/1715 cut-off events. For 9754/9754 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11081 event pairs, 45 based on Foata normal form. 66/1720 useless extension candidates. Maximal degree in co-relation 10186. Up to 682 conditions per place. [2023-01-27 22:42:43,433 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 232 selfloop transitions, 193 changer transitions 38/464 dead transitions. [2023-01-27 22:42:43,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 464 transitions, 5595 flow [2023-01-27 22:42:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-27 22:42:43,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-01-27 22:42:43,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3573 transitions. [2023-01-27 22:42:43,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3261226725082147 [2023-01-27 22:42:43,439 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 3573 transitions. [2023-01-27 22:42:43,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 3573 transitions. [2023-01-27 22:42:43,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:43,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 3573 transitions. [2023-01-27 22:42:43,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 81.20454545454545) internal successors, (3573), 44 states have internal predecessors, (3573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:43,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 249.0) internal successors, (11205), 45 states have internal predecessors, (11205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:43,455 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 249.0) internal successors, (11205), 45 states have internal predecessors, (11205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:43,455 INFO L175 Difference]: Start difference. First operand has 136 places, 156 transitions, 1880 flow. Second operand 44 states and 3573 transitions. [2023-01-27 22:42:43,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 464 transitions, 5595 flow [2023-01-27 22:42:43,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 464 transitions, 5125 flow, removed 213 selfloop flow, removed 13 redundant places. [2023-01-27 22:42:43,489 INFO L231 Difference]: Finished difference. Result has 179 places, 286 transitions, 4127 flow [2023-01-27 22:42:43,489 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1770, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4127, PETRI_PLACES=179, PETRI_TRANSITIONS=286} [2023-01-27 22:42:43,490 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 158 predicate places. [2023-01-27 22:42:43,490 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 286 transitions, 4127 flow [2023-01-27 22:42:43,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 76.64516129032258) internal successors, (2376), 31 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:43,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:43,490 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:43,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:43,696 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,SelfDestructingSolverStorable13 [2023-01-27 22:42:43,696 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:43,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:43,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1324482178, now seen corresponding path program 8 times [2023-01-27 22:42:43,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:43,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470723659] [2023-01-27 22:42:43,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:43,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:44,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470723659] [2023-01-27 22:42:44,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470723659] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:44,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542295488] [2023-01-27 22:42:44,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:42:44,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:44,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:44,073 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:44,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-27 22:42:44,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:42:44,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:44,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2023-01-27 22:42:44,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:44,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:44,412 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 22:42:44,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-01-27 22:42:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542295488] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:44,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:44,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2023-01-27 22:42:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170840312] [2023-01-27 22:42:44,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:44,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-27 22:42:44,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:44,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-27 22:42:44,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2023-01-27 22:42:44,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 249 [2023-01-27 22:42:44,594 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 286 transitions, 4127 flow. Second operand has 28 states, 28 states have (on average 85.64285714285714) internal successors, (2398), 28 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:44,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:44,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 249 [2023-01-27 22:42:44,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:46,377 INFO L130 PetriNetUnfolder]: 918/1950 cut-off events. [2023-01-27 22:42:46,378 INFO L131 PetriNetUnfolder]: For 20049/20057 co-relation queries the response was YES. [2023-01-27 22:42:46,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13166 conditions, 1950 events. 918/1950 cut-off events. For 20049/20057 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 12686 event pairs, 81 based on Foata normal form. 177/2101 useless extension candidates. Maximal degree in co-relation 13106. Up to 1014 conditions per place. [2023-01-27 22:42:46,389 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 244 selfloop transitions, 144 changer transitions 60/453 dead transitions. [2023-01-27 22:42:46,389 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 453 transitions, 6525 flow [2023-01-27 22:42:46,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-27 22:42:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-01-27 22:42:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 3756 transitions. [2023-01-27 22:42:46,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3591508892713712 [2023-01-27 22:42:46,392 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 3756 transitions. [2023-01-27 22:42:46,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 3756 transitions. [2023-01-27 22:42:46,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:46,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 3756 transitions. [2023-01-27 22:42:46,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 89.42857142857143) internal successors, (3756), 42 states have internal predecessors, (3756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:46,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 249.0) internal successors, (10707), 43 states have internal predecessors, (10707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:46,402 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 249.0) internal successors, (10707), 43 states have internal predecessors, (10707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:46,402 INFO L175 Difference]: Start difference. First operand has 179 places, 286 transitions, 4127 flow. Second operand 42 states and 3756 transitions. [2023-01-27 22:42:46,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 453 transitions, 6525 flow [2023-01-27 22:42:46,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 453 transitions, 5635 flow, removed 373 selfloop flow, removed 26 redundant places. [2023-01-27 22:42:46,483 INFO L231 Difference]: Finished difference. Result has 199 places, 263 transitions, 4002 flow [2023-01-27 22:42:46,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2752, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=94, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4002, PETRI_PLACES=199, PETRI_TRANSITIONS=263} [2023-01-27 22:42:46,483 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 178 predicate places. [2023-01-27 22:42:46,483 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 263 transitions, 4002 flow [2023-01-27 22:42:46,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 85.64285714285714) internal successors, (2398), 28 states have internal predecessors, (2398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:46,485 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:46,485 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:46,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:46,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-27 22:42:46,690 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:46,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:46,690 INFO L85 PathProgramCache]: Analyzing trace with hash -472197264, now seen corresponding path program 9 times [2023-01-27 22:42:46,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:46,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235166558] [2023-01-27 22:42:46,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:46,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:46,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235166558] [2023-01-27 22:42:46,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235166558] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132268939] [2023-01-27 22:42:46,998 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:42:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:46,999 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:47,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-01-27 22:42:47,210 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:42:47,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:47,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 15 conjunts are in the unsatisfiable core [2023-01-27 22:42:47,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:42:47,266 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:47,301 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 22:42:47,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-01-27 22:42:47,313 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:42:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132268939] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:47,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 16 [2023-01-27 22:42:47,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652534534] [2023-01-27 22:42:47,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:47,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-01-27 22:42:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-01-27 22:42:47,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2023-01-27 22:42:47,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 249 [2023-01-27 22:42:47,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 263 transitions, 4002 flow. Second operand has 17 states, 17 states have (on average 86.11764705882354) internal successors, (1464), 17 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:47,315 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:47,315 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 249 [2023-01-27 22:42:47,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:48,101 INFO L130 PetriNetUnfolder]: 796/1657 cut-off events. [2023-01-27 22:42:48,101 INFO L131 PetriNetUnfolder]: For 18513/18521 co-relation queries the response was YES. [2023-01-27 22:42:48,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11265 conditions, 1657 events. 796/1657 cut-off events. For 18513/18521 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10011 event pairs, 76 based on Foata normal form. 46/1675 useless extension candidates. Maximal degree in co-relation 11201. Up to 1174 conditions per place. [2023-01-27 22:42:48,111 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 226 selfloop transitions, 105 changer transitions 9/345 dead transitions. [2023-01-27 22:42:48,111 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 345 transitions, 5108 flow [2023-01-27 22:42:48,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-01-27 22:42:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-01-27 22:42:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2488 transitions. [2023-01-27 22:42:48,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3568559954102123 [2023-01-27 22:42:48,114 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2488 transitions. [2023-01-27 22:42:48,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2488 transitions. [2023-01-27 22:42:48,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:48,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2488 transitions. [2023-01-27 22:42:48,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 88.85714285714286) internal successors, (2488), 28 states have internal predecessors, (2488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:48,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 249.0) internal successors, (7221), 29 states have internal predecessors, (7221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:48,120 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 249.0) internal successors, (7221), 29 states have internal predecessors, (7221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:48,120 INFO L175 Difference]: Start difference. First operand has 199 places, 263 transitions, 4002 flow. Second operand 28 states and 2488 transitions. [2023-01-27 22:42:48,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 345 transitions, 5108 flow [2023-01-27 22:42:48,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 345 transitions, 4676 flow, removed 153 selfloop flow, removed 35 redundant places. [2023-01-27 22:42:48,189 INFO L231 Difference]: Finished difference. Result has 181 places, 261 transitions, 3856 flow [2023-01-27 22:42:48,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3443, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3856, PETRI_PLACES=181, PETRI_TRANSITIONS=261} [2023-01-27 22:42:48,189 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 160 predicate places. [2023-01-27 22:42:48,189 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 261 transitions, 3856 flow [2023-01-27 22:42:48,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 86.11764705882354) internal successors, (1464), 17 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:48,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:48,190 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:48,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:48,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-27 22:42:48,395 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:48,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1695030954, now seen corresponding path program 10 times [2023-01-27 22:42:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595472254] [2023-01-27 22:42:48,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:48,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:48,896 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:48,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595472254] [2023-01-27 22:42:48,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595472254] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:48,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140746518] [2023-01-27 22:42:48,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:42:48,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:48,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:48,898 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:48,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-01-27 22:42:48,978 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:42:48,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:48,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-27 22:42:48,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:49,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:49,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:42:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:49,435 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:49,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:49,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-01-27 22:42:49,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-27 22:42:49,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140746518] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:49,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-01-27 22:42:49,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896268011] [2023-01-27 22:42:49,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:49,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-01-27 22:42:49,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:49,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-01-27 22:42:49,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2023-01-27 22:42:49,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:42:49,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 261 transitions, 3856 flow. Second operand has 31 states, 31 states have (on average 81.54838709677419) internal successors, (2528), 31 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:49,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:49,949 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:42:49,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:52,354 INFO L130 PetriNetUnfolder]: 1057/2211 cut-off events. [2023-01-27 22:42:52,354 INFO L131 PetriNetUnfolder]: For 21865/21883 co-relation queries the response was YES. [2023-01-27 22:42:52,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14284 conditions, 2211 events. 1057/2211 cut-off events. For 21865/21883 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 14072 event pairs, 90 based on Foata normal form. 52/2220 useless extension candidates. Maximal degree in co-relation 14229. Up to 1076 conditions per place. [2023-01-27 22:42:52,366 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 222 selfloop transitions, 192 changer transitions 5/424 dead transitions. [2023-01-27 22:42:52,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 424 transitions, 6135 flow [2023-01-27 22:42:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-27 22:42:52,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-27 22:42:52,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2741 transitions. [2023-01-27 22:42:52,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34400100401606426 [2023-01-27 22:42:52,387 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2741 transitions. [2023-01-27 22:42:52,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2741 transitions. [2023-01-27 22:42:52,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:52,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2741 transitions. [2023-01-27 22:42:52,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 85.65625) internal successors, (2741), 32 states have internal predecessors, (2741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:52,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 249.0) internal successors, (8217), 33 states have internal predecessors, (8217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:52,393 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 249.0) internal successors, (8217), 33 states have internal predecessors, (8217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:52,393 INFO L175 Difference]: Start difference. First operand has 181 places, 261 transitions, 3856 flow. Second operand 32 states and 2741 transitions. [2023-01-27 22:42:52,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 424 transitions, 6135 flow [2023-01-27 22:42:52,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 424 transitions, 5778 flow, removed 98 selfloop flow, removed 20 redundant places. [2023-01-27 22:42:52,492 INFO L231 Difference]: Finished difference. Result has 200 places, 326 transitions, 5098 flow [2023-01-27 22:42:52,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3585, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=5098, PETRI_PLACES=200, PETRI_TRANSITIONS=326} [2023-01-27 22:42:52,492 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 179 predicate places. [2023-01-27 22:42:52,492 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 326 transitions, 5098 flow [2023-01-27 22:42:52,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 81.54838709677419) internal successors, (2528), 31 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:52,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:52,493 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:52,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-01-27 22:42:52,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:52,698 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:52,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1736267358, now seen corresponding path program 11 times [2023-01-27 22:42:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:52,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968212421] [2023-01-27 22:42:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:53,068 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:53,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968212421] [2023-01-27 22:42:53,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968212421] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:53,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039207059] [2023-01-27 22:42:53,068 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:42:53,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:53,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:53,085 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:53,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-01-27 22:42:53,198 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:42:53,198 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:53,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 38 conjunts are in the unsatisfiable core [2023-01-27 22:42:53,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:53,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:42:53,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-27 22:42:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:53,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:53,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:53,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-01-27 22:42:53,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-27 22:42:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:53,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039207059] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:42:53,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:42:53,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2023-01-27 22:42:53,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720130981] [2023-01-27 22:42:53,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:42:53,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-27 22:42:53,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:42:53,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-27 22:42:53,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=826, Unknown=3, NotChecked=0, Total=992 [2023-01-27 22:42:53,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:42:53,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 326 transitions, 5098 flow. Second operand has 32 states, 32 states have (on average 81.5625) internal successors, (2610), 32 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:53,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:42:53,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:42:53,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:42:56,032 INFO L130 PetriNetUnfolder]: 1387/2820 cut-off events. [2023-01-27 22:42:56,033 INFO L131 PetriNetUnfolder]: For 34449/34473 co-relation queries the response was YES. [2023-01-27 22:42:56,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19895 conditions, 2820 events. 1387/2820 cut-off events. For 34449/34473 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 18300 event pairs, 80 based on Foata normal form. 112/2893 useless extension candidates. Maximal degree in co-relation 19834. Up to 1474 conditions per place. [2023-01-27 22:42:56,053 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 278 selfloop transitions, 263 changer transitions 27/572 dead transitions. [2023-01-27 22:42:56,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 572 transitions, 8996 flow [2023-01-27 22:42:56,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-01-27 22:42:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-01-27 22:42:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3426 transitions. [2023-01-27 22:42:56,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34397590361445785 [2023-01-27 22:42:56,064 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3426 transitions. [2023-01-27 22:42:56,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3426 transitions. [2023-01-27 22:42:56,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:42:56,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3426 transitions. [2023-01-27 22:42:56,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 85.65) internal successors, (3426), 40 states have internal predecessors, (3426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:56,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 249.0) internal successors, (10209), 41 states have internal predecessors, (10209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:56,072 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 249.0) internal successors, (10209), 41 states have internal predecessors, (10209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:56,072 INFO L175 Difference]: Start difference. First operand has 200 places, 326 transitions, 5098 flow. Second operand 40 states and 3426 transitions. [2023-01-27 22:42:56,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 572 transitions, 8996 flow [2023-01-27 22:42:56,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 572 transitions, 8305 flow, removed 129 selfloop flow, removed 27 redundant places. [2023-01-27 22:42:56,187 INFO L231 Difference]: Finished difference. Result has 212 places, 394 transitions, 7133 flow [2023-01-27 22:42:56,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3564, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=7133, PETRI_PLACES=212, PETRI_TRANSITIONS=394} [2023-01-27 22:42:56,187 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 191 predicate places. [2023-01-27 22:42:56,187 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 394 transitions, 7133 flow [2023-01-27 22:42:56,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 81.5625) internal successors, (2610), 32 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:42:56,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:42:56,188 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:42:56,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-01-27 22:42:56,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-27 22:42:56,392 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:42:56,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:42:56,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1061577117, now seen corresponding path program 12 times [2023-01-27 22:42:56,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:42:56,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450780637] [2023-01-27 22:42:56,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:42:56,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:42:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:42:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:42:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450780637] [2023-01-27 22:42:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450780637] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:42:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365758427] [2023-01-27 22:42:57,076 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:42:57,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:42:57,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:42:57,077 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:42:57,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-01-27 22:42:57,163 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:42:57,163 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:42:57,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 82 conjunts are in the unsatisfiable core [2023-01-27 22:42:57,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:42:57,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:42:57,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:42:57,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-01-27 22:42:57,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:42:57,348 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:42:57,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:57,652 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2023-01-27 22:42:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:42:57,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:42:58,290 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~q_front~0 2))) (or (<= c_~n~0 .cse0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse9 (* c_~q_front~0 4)) (.cse10 (* 4 c_~q_back~0))) (let ((.cse4 (+ .cse10 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse2 (+ .cse9 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse1 .cse6))) (or (< (+ c_~s~0 (select .cse1 .cse2) .cse3) 3) (not (= (select .cse1 .cse4) 1)) (= .cse3 0) (not (= (select .cse1 .cse5) 1)))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse7 .cse6))) (or (not (= (select .cse7 .cse4) 1)) (= .cse8 0) (not (= (select .cse7 .cse5) 1)) (< 1 (+ c_~s~0 (select .cse7 .cse2) .cse8))))))))) (< c_~q_back~0 0) (<= c_~n~0 c_~q_back~0) (< .cse0 0))) is different from false [2023-01-27 22:42:58,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:58,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 230 treesize of output 128 [2023-01-27 22:42:58,665 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:58,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 325 treesize of output 319 [2023-01-27 22:42:58,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:58,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 283 treesize of output 255 [2023-01-27 22:42:58,715 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:42:58,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 171 treesize of output 175 [2023-01-27 22:43:00,225 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:00,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 230 treesize of output 128 [2023-01-27 22:43:00,243 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:43:00,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 691 treesize of output 615 [2023-01-27 22:43:00,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:00,265 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:43:00,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:00,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 167 [2023-01-27 22:43:00,284 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:43:00,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 203 treesize of output 147 [2023-01-27 22:43:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-01-27 22:43:00,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365758427] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:00,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:00,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2023-01-27 22:43:00,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637940059] [2023-01-27 22:43:00,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:00,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-01-27 22:43:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-01-27 22:43:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1214, Unknown=5, NotChecked=72, Total=1482 [2023-01-27 22:43:00,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:43:00,434 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 394 transitions, 7133 flow. Second operand has 39 states, 39 states have (on average 67.48717948717949) internal successors, (2632), 39 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:00,434 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:00,434 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:43:00,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:00,767 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse23 (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse26 (* 4 c_~q_back~0)) (.cse25 (* c_~q_front~0 4)) (.cse24 (+ c_~q_front~0 2))) (let ((.cse0 (<= c_~n~0 .cse24)) (.cse2 (+ .cse25 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ .cse26 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (+ .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse15 (+ .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (< c_~q_back~0 0)) (.cse10 (<= c_~n~0 c_~q_back~0)) (.cse11 (< .cse24 0))) (and (or .cse0 (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse1 .cse6))) (or (< (+ c_~s~0 (select .cse1 .cse2) .cse3) 3) (not (= (select .cse1 .cse4) 1)) (= .cse3 0) (not (= (select .cse1 .cse5) 1)))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse8 (select .cse7 .cse6))) (or (not (= (select .cse7 .cse4) 1)) (= .cse8 0) (not (= (select .cse7 .cse5) 1)) (< 1 (+ c_~s~0 (select .cse7 .cse2) .cse8))))))) .cse9 .cse10 .cse11) (or .cse0 .cse9 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse10 (and (forall ((v_ArrVal_628 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse14 .cse15 v_ArrVal_628)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 .cse6))) (or (< 1 (+ c_~s~0 (select .cse12 .cse2) .cse13)) (not (= (select .cse12 .cse4) 1)) (not (= (select .cse12 .cse5) 1)) (= .cse13 0))))) (forall ((v_ArrVal_628 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse16 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store .cse14 .cse15 v_ArrVal_628)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse17 (select .cse16 .cse6))) (or (not (= (select .cse16 .cse4) 1)) (< (+ c_~s~0 (select .cse16 .cse2) .cse17) 3) (not (= (select .cse16 .cse5) 1)) (= .cse17 0)))))) .cse11) (or .cse0 (let ((.cse20 (+ .cse23 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_628 Int) (v_ArrVal_627 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse19 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse14 .cse15 v_ArrVal_627) .cse20 v_ArrVal_628)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse18 (select .cse19 .cse6))) (or (< 1 (+ c_~s~0 .cse18 (select .cse19 .cse2))) (not (= (select .cse19 .cse4) 1)) (= .cse18 0) (not (= (select .cse19 .cse5) 1)))))) (forall ((v_ArrVal_628 Int) (v_ArrVal_627 Int) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (let ((.cse22 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (store .cse14 .cse15 v_ArrVal_627) .cse20 v_ArrVal_628)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_631) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse22 .cse6))) (or (< (+ c_~s~0 .cse21 (select .cse22 .cse2)) 3) (not (= (select .cse22 .cse4) 1)) (= .cse21 0) (not (= (select .cse22 .cse5) 1)))))))) (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9 .cse10 .cse11)))) is different from false [2023-01-27 22:43:03,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:43:07,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:43:09,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-01-27 22:43:12,978 INFO L130 PetriNetUnfolder]: 1552/3218 cut-off events. [2023-01-27 22:43:12,978 INFO L131 PetriNetUnfolder]: For 42184/42184 co-relation queries the response was YES. [2023-01-27 22:43:12,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23768 conditions, 3218 events. 1552/3218 cut-off events. For 42184/42184 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 21693 event pairs, 470 based on Foata normal form. 8/3205 useless extension candidates. Maximal degree in co-relation 23703. Up to 2667 conditions per place. [2023-01-27 22:43:13,000 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 426 selfloop transitions, 104 changer transitions 53/584 dead transitions. [2023-01-27 22:43:13,000 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 584 transitions, 10493 flow [2023-01-27 22:43:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-01-27 22:43:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-01-27 22:43:13,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3092 transitions. [2023-01-27 22:43:13,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2822197882438846 [2023-01-27 22:43:13,003 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 3092 transitions. [2023-01-27 22:43:13,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 3092 transitions. [2023-01-27 22:43:13,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:13,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 3092 transitions. [2023-01-27 22:43:13,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 70.27272727272727) internal successors, (3092), 44 states have internal predecessors, (3092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:13,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 249.0) internal successors, (11205), 45 states have internal predecessors, (11205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:13,011 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 249.0) internal successors, (11205), 45 states have internal predecessors, (11205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:13,011 INFO L175 Difference]: Start difference. First operand has 212 places, 394 transitions, 7133 flow. Second operand 44 states and 3092 transitions. [2023-01-27 22:43:13,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 584 transitions, 10493 flow [2023-01-27 22:43:13,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 584 transitions, 9782 flow, removed 309 selfloop flow, removed 11 redundant places. [2023-01-27 22:43:13,278 INFO L231 Difference]: Finished difference. Result has 250 places, 463 transitions, 8164 flow [2023-01-27 22:43:13,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=6536, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=394, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=8164, PETRI_PLACES=250, PETRI_TRANSITIONS=463} [2023-01-27 22:43:13,279 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 229 predicate places. [2023-01-27 22:43:13,279 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 463 transitions, 8164 flow [2023-01-27 22:43:13,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 67.48717948717949) internal successors, (2632), 39 states have internal predecessors, (2632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:13,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:13,279 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:43:13,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:13,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:13,485 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:43:13,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:13,486 INFO L85 PathProgramCache]: Analyzing trace with hash -436130689, now seen corresponding path program 13 times [2023-01-27 22:43:13,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:13,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49711291] [2023-01-27 22:43:13,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:13,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:14,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49711291] [2023-01-27 22:43:14,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49711291] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:14,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180020584] [2023-01-27 22:43:14,292 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:43:14,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:14,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:14,293 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:14,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-01-27 22:43:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:14,378 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjunts are in the unsatisfiable core [2023-01-27 22:43:14,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:14,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:14,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-27 22:43:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:43:14,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:14,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:14,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-01-27 22:43:14,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-27 22:43:14,725 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:43:14,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180020584] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:14,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:14,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 25 [2023-01-27 22:43:14,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561386760] [2023-01-27 22:43:14,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:14,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-27 22:43:14,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:14,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-27 22:43:14,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=583, Unknown=4, NotChecked=0, Total=650 [2023-01-27 22:43:14,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:43:14,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 463 transitions, 8164 flow. Second operand has 26 states, 26 states have (on average 81.84615384615384) internal successors, (2128), 26 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:14,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:14,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:43:14,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:16,358 INFO L130 PetriNetUnfolder]: 1628/3291 cut-off events. [2023-01-27 22:43:16,358 INFO L131 PetriNetUnfolder]: For 43943/43956 co-relation queries the response was YES. [2023-01-27 22:43:16,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24455 conditions, 3291 events. 1628/3291 cut-off events. For 43943/43956 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 22005 event pairs, 90 based on Foata normal form. 47/3310 useless extension candidates. Maximal degree in co-relation 24370. Up to 2082 conditions per place. [2023-01-27 22:43:16,379 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 345 selfloop transitions, 210 changer transitions 0/564 dead transitions. [2023-01-27 22:43:16,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 564 transitions, 10586 flow [2023-01-27 22:43:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-01-27 22:43:16,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-01-27 22:43:16,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1526 transitions. [2023-01-27 22:43:16,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3404730031236055 [2023-01-27 22:43:16,381 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1526 transitions. [2023-01-27 22:43:16,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1526 transitions. [2023-01-27 22:43:16,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:16,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1526 transitions. [2023-01-27 22:43:16,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 84.77777777777777) internal successors, (1526), 18 states have internal predecessors, (1526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:16,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 249.0) internal successors, (4731), 19 states have internal predecessors, (4731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:16,385 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 249.0) internal successors, (4731), 19 states have internal predecessors, (4731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:16,385 INFO L175 Difference]: Start difference. First operand has 250 places, 463 transitions, 8164 flow. Second operand 18 states and 1526 transitions. [2023-01-27 22:43:16,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 564 transitions, 10586 flow [2023-01-27 22:43:16,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 564 transitions, 10394 flow, removed 80 selfloop flow, removed 18 redundant places. [2023-01-27 22:43:16,653 INFO L231 Difference]: Finished difference. Result has 244 places, 499 transitions, 9354 flow [2023-01-27 22:43:16,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=7914, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=457, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=169, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=9354, PETRI_PLACES=244, PETRI_TRANSITIONS=499} [2023-01-27 22:43:16,653 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2023-01-27 22:43:16,653 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 499 transitions, 9354 flow [2023-01-27 22:43:16,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 81.84615384615384) internal successors, (2128), 26 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:16,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:16,654 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:43:16,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:16,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:16,859 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:43:16,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:16,859 INFO L85 PathProgramCache]: Analyzing trace with hash 357366867, now seen corresponding path program 14 times [2023-01-27 22:43:16,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:16,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873696902] [2023-01-27 22:43:16,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:16,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873696902] [2023-01-27 22:43:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873696902] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699507357] [2023-01-27 22:43:17,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:43:17,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:17,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:17,506 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:17,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-01-27 22:43:17,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:43:17,598 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:17,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 60 conjunts are in the unsatisfiable core [2023-01-27 22:43:17,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:18,069 INFO L321 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2023-01-27 22:43:18,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 20 [2023-01-27 22:43:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:18,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:18,614 INFO L321 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2023-01-27 22:43:18,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 96 treesize of output 120 [2023-01-27 22:43:19,850 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:19,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699507357] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:19,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2023-01-27 22:43:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684443634] [2023-01-27 22:43:19,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:19,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-27 22:43:19,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:19,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-27 22:43:19,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1126, Unknown=0, NotChecked=0, Total=1332 [2023-01-27 22:43:19,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 249 [2023-01-27 22:43:19,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 499 transitions, 9354 flow. Second operand has 37 states, 37 states have (on average 74.56756756756756) internal successors, (2759), 37 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:19,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:19,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 249 [2023-01-27 22:43:19,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:24,527 INFO L130 PetriNetUnfolder]: 1749/3614 cut-off events. [2023-01-27 22:43:24,528 INFO L131 PetriNetUnfolder]: For 51864/51864 co-relation queries the response was YES. [2023-01-27 22:43:24,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26969 conditions, 3614 events. 1749/3614 cut-off events. For 51864/51864 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 25111 event pairs, 286 based on Foata normal form. 9/3598 useless extension candidates. Maximal degree in co-relation 26887. Up to 1337 conditions per place. [2023-01-27 22:43:24,558 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 364 selfloop transitions, 248 changer transitions 38/651 dead transitions. [2023-01-27 22:43:24,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 651 transitions, 11925 flow [2023-01-27 22:43:24,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-27 22:43:24,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-01-27 22:43:24,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2661 transitions. [2023-01-27 22:43:24,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3143160878809355 [2023-01-27 22:43:24,560 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2661 transitions. [2023-01-27 22:43:24,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2661 transitions. [2023-01-27 22:43:24,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:24,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2661 transitions. [2023-01-27 22:43:24,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 78.26470588235294) internal successors, (2661), 34 states have internal predecessors, (2661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:24,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 249.0) internal successors, (8715), 35 states have internal predecessors, (8715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:24,567 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 249.0) internal successors, (8715), 35 states have internal predecessors, (8715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:24,567 INFO L175 Difference]: Start difference. First operand has 244 places, 499 transitions, 9354 flow. Second operand 34 states and 2661 transitions. [2023-01-27 22:43:24,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 651 transitions, 11925 flow [2023-01-27 22:43:24,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 651 transitions, 11752 flow, removed 45 selfloop flow, removed 8 redundant places. [2023-01-27 22:43:24,937 INFO L231 Difference]: Finished difference. Result has 275 places, 526 transitions, 10439 flow [2023-01-27 22:43:24,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=9181, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=214, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=10439, PETRI_PLACES=275, PETRI_TRANSITIONS=526} [2023-01-27 22:43:24,941 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 254 predicate places. [2023-01-27 22:43:24,941 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 526 transitions, 10439 flow [2023-01-27 22:43:24,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 74.56756756756756) internal successors, (2759), 37 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:24,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:24,942 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:43:24,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:25,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:25,147 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:43:25,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 115815223, now seen corresponding path program 15 times [2023-01-27 22:43:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576258876] [2023-01-27 22:43:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:25,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576258876] [2023-01-27 22:43:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576258876] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452592512] [2023-01-27 22:43:25,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:43:25,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:25,963 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:25,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-01-27 22:43:26,205 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 22:43:26,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:26,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 62 conjunts are in the unsatisfiable core [2023-01-27 22:43:26,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:26,538 INFO L321 Elim1Store]: treesize reduction 19, result has 34.5 percent of original size [2023-01-27 22:43:26,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 22 [2023-01-27 22:43:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:26,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:27,228 INFO L321 Elim1Store]: treesize reduction 8, result has 90.1 percent of original size [2023-01-27 22:43:27,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 130 [2023-01-27 22:43:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452592512] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:28,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:28,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-01-27 22:43:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83624072] [2023-01-27 22:43:28,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:28,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:43:28,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:28,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:43:28,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1214, Unknown=0, NotChecked=0, Total=1406 [2023-01-27 22:43:28,890 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:43:28,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 526 transitions, 10439 flow. Second operand has 38 states, 38 states have (on average 67.52631578947368) internal successors, (2566), 38 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:28,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:28,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:43:28,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:34,511 INFO L130 PetriNetUnfolder]: 1895/3963 cut-off events. [2023-01-27 22:43:34,511 INFO L131 PetriNetUnfolder]: For 62052/62052 co-relation queries the response was YES. [2023-01-27 22:43:34,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31620 conditions, 3963 events. 1895/3963 cut-off events. For 62052/62052 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 28177 event pairs, 290 based on Foata normal form. 9/3965 useless extension candidates. Maximal degree in co-relation 31532. Up to 1549 conditions per place. [2023-01-27 22:43:34,541 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 370 selfloop transitions, 288 changer transitions 43/702 dead transitions. [2023-01-27 22:43:34,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 702 transitions, 13826 flow [2023-01-27 22:43:34,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-27 22:43:34,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-27 22:43:34,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2710 transitions. [2023-01-27 22:43:34,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28640879306700484 [2023-01-27 22:43:34,543 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2710 transitions. [2023-01-27 22:43:34,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2710 transitions. [2023-01-27 22:43:34,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:34,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2710 transitions. [2023-01-27 22:43:34,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 71.3157894736842) internal successors, (2710), 38 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:34,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 249.0) internal successors, (9711), 39 states have internal predecessors, (9711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:34,550 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 249.0) internal successors, (9711), 39 states have internal predecessors, (9711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:34,550 INFO L175 Difference]: Start difference. First operand has 275 places, 526 transitions, 10439 flow. Second operand 38 states and 2710 transitions. [2023-01-27 22:43:34,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 702 transitions, 13826 flow [2023-01-27 22:43:34,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 702 transitions, 13451 flow, removed 164 selfloop flow, removed 18 redundant places. [2023-01-27 22:43:34,976 INFO L231 Difference]: Finished difference. Result has 298 places, 561 transitions, 11799 flow [2023-01-27 22:43:34,976 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=10190, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=526, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=11799, PETRI_PLACES=298, PETRI_TRANSITIONS=561} [2023-01-27 22:43:34,976 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 277 predicate places. [2023-01-27 22:43:34,977 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 561 transitions, 11799 flow [2023-01-27 22:43:34,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 67.52631578947368) internal successors, (2566), 38 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:34,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:34,977 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:43:34,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2023-01-27 22:43:35,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:35,182 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:43:35,182 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:35,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1311433263, now seen corresponding path program 16 times [2023-01-27 22:43:35,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:35,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142982992] [2023-01-27 22:43:35,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:35,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:35,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:35,759 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:35,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:35,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142982992] [2023-01-27 22:43:35,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142982992] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:35,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333765532] [2023-01-27 22:43:35,759 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:43:35,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:35,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:35,760 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:35,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-01-27 22:43:35,850 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:43:35,850 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:35,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-27 22:43:35,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-27 22:43:36,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:36,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:36,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 68 [2023-01-27 22:43:36,360 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:43:36,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333765532] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:36,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:36,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 7] total 26 [2023-01-27 22:43:36,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487347194] [2023-01-27 22:43:36,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:36,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-27 22:43:36,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:36,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-27 22:43:36,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2023-01-27 22:43:36,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 249 [2023-01-27 22:43:36,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 561 transitions, 11799 flow. Second operand has 28 states, 28 states have (on average 74.78571428571429) internal successors, (2094), 28 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:36,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:36,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 249 [2023-01-27 22:43:36,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:38,129 INFO L130 PetriNetUnfolder]: 1896/3934 cut-off events. [2023-01-27 22:43:38,129 INFO L131 PetriNetUnfolder]: For 66832/66832 co-relation queries the response was YES. [2023-01-27 22:43:38,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32943 conditions, 3934 events. 1896/3934 cut-off events. For 66832/66832 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 27586 event pairs, 638 based on Foata normal form. 8/3935 useless extension candidates. Maximal degree in co-relation 32850. Up to 3601 conditions per place. [2023-01-27 22:43:38,162 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 519 selfloop transitions, 83 changer transitions 40/643 dead transitions. [2023-01-27 22:43:38,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 643 transitions, 13903 flow [2023-01-27 22:43:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-01-27 22:43:38,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-01-27 22:43:38,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2169 transitions. [2023-01-27 22:43:38,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3111015490533563 [2023-01-27 22:43:38,164 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2169 transitions. [2023-01-27 22:43:38,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2169 transitions. [2023-01-27 22:43:38,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:38,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2169 transitions. [2023-01-27 22:43:38,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 77.46428571428571) internal successors, (2169), 28 states have internal predecessors, (2169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:38,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 249.0) internal successors, (7221), 29 states have internal predecessors, (7221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:38,171 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 249.0) internal successors, (7221), 29 states have internal predecessors, (7221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:38,171 INFO L175 Difference]: Start difference. First operand has 298 places, 561 transitions, 11799 flow. Second operand 28 states and 2169 transitions. [2023-01-27 22:43:38,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 643 transitions, 13903 flow [2023-01-27 22:43:38,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 643 transitions, 13561 flow, removed 129 selfloop flow, removed 23 redundant places. [2023-01-27 22:43:38,720 INFO L231 Difference]: Finished difference. Result has 302 places, 569 transitions, 11900 flow [2023-01-27 22:43:38,720 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=11465, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=11900, PETRI_PLACES=302, PETRI_TRANSITIONS=569} [2023-01-27 22:43:38,720 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 281 predicate places. [2023-01-27 22:43:38,720 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 569 transitions, 11900 flow [2023-01-27 22:43:38,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 74.78571428571429) internal successors, (2094), 28 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:38,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:38,721 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:43:38,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-01-27 22:43:38,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-01-27 22:43:38,926 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:43:38,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:38,926 INFO L85 PathProgramCache]: Analyzing trace with hash 296539241, now seen corresponding path program 17 times [2023-01-27 22:43:38,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:38,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736202226] [2023-01-27 22:43:38,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:38,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:38,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736202226] [2023-01-27 22:43:39,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736202226] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:39,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442508488] [2023-01-27 22:43:39,809 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:43:39,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:39,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:39,825 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:39,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-01-27 22:43:39,933 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:43:39,934 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:39,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 64 conjunts are in the unsatisfiable core [2023-01-27 22:43:39,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:40,242 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:40,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 7 [2023-01-27 22:43:40,304 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:40,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:40,521 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-27 22:43:40,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 58 [2023-01-27 22:43:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:40,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442508488] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:43:40,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:43:40,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 34 [2023-01-27 22:43:40,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713003412] [2023-01-27 22:43:40,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:43:40,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-27 22:43:40,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:43:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-27 22:43:40,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1040, Unknown=0, NotChecked=0, Total=1260 [2023-01-27 22:43:40,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:43:40,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 569 transitions, 11900 flow. Second operand has 36 states, 36 states have (on average 67.61111111111111) internal successors, (2434), 36 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:40,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:43:40,886 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:43:40,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:43:44,070 INFO L130 PetriNetUnfolder]: 1526/3146 cut-off events. [2023-01-27 22:43:44,070 INFO L131 PetriNetUnfolder]: For 59443/59443 co-relation queries the response was YES. [2023-01-27 22:43:44,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26439 conditions, 3146 events. 1526/3146 cut-off events. For 59443/59443 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 21000 event pairs, 165 based on Foata normal form. 266/3397 useless extension candidates. Maximal degree in co-relation 26341. Up to 1115 conditions per place. [2023-01-27 22:43:44,094 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 296 selfloop transitions, 270 changer transitions 146/713 dead transitions. [2023-01-27 22:43:44,094 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 713 transitions, 15342 flow [2023-01-27 22:43:44,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-01-27 22:43:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-01-27 22:43:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2759 transitions. [2023-01-27 22:43:44,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2841108021830913 [2023-01-27 22:43:44,097 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 2759 transitions. [2023-01-27 22:43:44,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 2759 transitions. [2023-01-27 22:43:44,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:43:44,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 2759 transitions. [2023-01-27 22:43:44,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 70.74358974358974) internal successors, (2759), 39 states have internal predecessors, (2759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:44,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 249.0) internal successors, (9960), 40 states have internal predecessors, (9960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:44,105 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 249.0) internal successors, (9960), 40 states have internal predecessors, (9960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:44,105 INFO L175 Difference]: Start difference. First operand has 302 places, 569 transitions, 11900 flow. Second operand 39 states and 2759 transitions. [2023-01-27 22:43:44,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 713 transitions, 15342 flow [2023-01-27 22:43:44,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 713 transitions, 14514 flow, removed 203 selfloop flow, removed 30 redundant places. [2023-01-27 22:43:44,451 INFO L231 Difference]: Finished difference. Result has 307 places, 499 transitions, 10796 flow [2023-01-27 22:43:44,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=10588, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=10796, PETRI_PLACES=307, PETRI_TRANSITIONS=499} [2023-01-27 22:43:44,451 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 286 predicate places. [2023-01-27 22:43:44,451 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 499 transitions, 10796 flow [2023-01-27 22:43:44,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 67.61111111111111) internal successors, (2434), 36 states have internal predecessors, (2434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:43:44,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:43:44,452 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:43:44,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-01-27 22:43:44,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-01-27 22:43:44,653 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:43:44,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:43:44,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1580432735, now seen corresponding path program 18 times [2023-01-27 22:43:44,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:43:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383356624] [2023-01-27 22:43:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:43:44,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:43:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:43:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:45,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:43:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383356624] [2023-01-27 22:43:45,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383356624] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:43:45,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966315782] [2023-01-27 22:43:45,478 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:43:45,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:43:45,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:43:45,481 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:43:45,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-01-27 22:43:45,577 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:43:45,577 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:43:45,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 78 conjunts are in the unsatisfiable core [2023-01-27 22:43:45,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:43:45,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 22:43:45,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 22:43:45,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 22:43:45,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:43:45,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:43:45,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-01-27 22:43:46,054 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-01-27 22:43:46,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 22 [2023-01-27 22:43:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:43:46,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:43:47,643 INFO L321 Elim1Store]: treesize reduction 104, result has 49.3 percent of original size [2023-01-27 22:43:47,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 283 [2023-01-27 22:43:47,667 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,670 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 220 [2023-01-27 22:43:47,738 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 644 treesize of output 699 [2023-01-27 22:43:47,795 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,796 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 344 treesize of output 364 [2023-01-27 22:43:47,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 319 treesize of output 304 [2023-01-27 22:43:47,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 330 treesize of output 413 [2023-01-27 22:43:47,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 270 treesize of output 290 [2023-01-27 22:43:47,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:43:47,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 230 [2023-01-27 22:45:59,173 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:45:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:45:59,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966315782] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:45:59,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:45:59,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2023-01-27 22:45:59,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307473681] [2023-01-27 22:45:59,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:45:59,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-27 22:45:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:45:59,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-27 22:45:59,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1388, Unknown=4, NotChecked=0, Total=1560 [2023-01-27 22:45:59,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:45:59,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 499 transitions, 10796 flow. Second operand has 40 states, 40 states have (on average 67.45) internal successors, (2698), 40 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:45:59,257 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:45:59,257 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:45:59,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:07,331 WARN L222 SmtUtils]: Spent 6.48s on a formula simplification. DAG size of input: 146 DAG size of output: 125 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:46:17,092 INFO L130 PetriNetUnfolder]: 1309/2570 cut-off events. [2023-01-27 22:46:17,092 INFO L131 PetriNetUnfolder]: For 42262/42266 co-relation queries the response was YES. [2023-01-27 22:46:17,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22236 conditions, 2570 events. 1309/2570 cut-off events. For 42262/42266 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16123 event pairs, 114 based on Foata normal form. 14/2581 useless extension candidates. Maximal degree in co-relation 22141. Up to 1148 conditions per place. [2023-01-27 22:46:17,114 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 279 selfloop transitions, 215 changer transitions 88/583 dead transitions. [2023-01-27 22:46:17,114 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 583 transitions, 12746 flow [2023-01-27 22:46:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-01-27 22:46:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-01-27 22:46:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2176 transitions. [2023-01-27 22:46:17,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28190180075139265 [2023-01-27 22:46:17,116 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2176 transitions. [2023-01-27 22:46:17,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2176 transitions. [2023-01-27 22:46:17,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:17,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2176 transitions. [2023-01-27 22:46:17,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 70.19354838709677) internal successors, (2176), 31 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:17,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 249.0) internal successors, (7968), 32 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:17,122 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 249.0) internal successors, (7968), 32 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:17,122 INFO L175 Difference]: Start difference. First operand has 307 places, 499 transitions, 10796 flow. Second operand 31 states and 2176 transitions. [2023-01-27 22:46:17,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 583 transitions, 12746 flow [2023-01-27 22:46:17,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 583 transitions, 11970 flow, removed 253 selfloop flow, removed 31 redundant places. [2023-01-27 22:46:17,457 INFO L231 Difference]: Finished difference. Result has 298 places, 460 transitions, 9931 flow [2023-01-27 22:46:17,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=10085, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=9931, PETRI_PLACES=298, PETRI_TRANSITIONS=460} [2023-01-27 22:46:17,458 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 277 predicate places. [2023-01-27 22:46:17,458 INFO L495 AbstractCegarLoop]: Abstraction has has 298 places, 460 transitions, 9931 flow [2023-01-27 22:46:17,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 67.45) internal successors, (2698), 40 states have internal predecessors, (2698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:17,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:17,458 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:17,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-01-27 22:46:17,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:17,663 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:17,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -348910683, now seen corresponding path program 19 times [2023-01-27 22:46:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:17,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085944968] [2023-01-27 22:46:17,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:18,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:18,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085944968] [2023-01-27 22:46:18,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085944968] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:18,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58965813] [2023-01-27 22:46:18,511 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:46:18,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:18,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:18,512 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:18,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-01-27 22:46:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:18,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 64 conjunts are in the unsatisfiable core [2023-01-27 22:46:18,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:18,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:18,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-27 22:46:19,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:19,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 7 [2023-01-27 22:46:19,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:19,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:19,420 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:19,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 170 [2023-01-27 22:46:19,440 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:19,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 128 [2023-01-27 22:46:19,454 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:19,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 108 [2023-01-27 22:46:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:20,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58965813] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:20,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:20,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-01-27 22:46:20,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372637091] [2023-01-27 22:46:20,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:20,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:46:20,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:20,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:46:20,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1216, Unknown=4, NotChecked=0, Total=1406 [2023-01-27 22:46:20,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:46:20,102 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 460 transitions, 9931 flow. Second operand has 38 states, 38 states have (on average 70.52631578947368) internal successors, (2680), 38 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:20,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:20,103 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:46:20,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:21,699 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~q_front~0 4))) (let ((.cse8 (<= c_~s~0 c_~N~0)) (.cse2 (< c_~n~0 1)) (.cse3 (< c_~n~0 (+ 2 c_~q_back~0))) (.cse7 (+ .cse11 c_~q~0.offset 4)) (.cse6 (+ .cse11 c_~q~0.offset)) (.cse5 (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)) (.cse1 (+ c_~q~0.offset (* 4 c_~q_back~0)))) (and (<= c_~N~0 c_~s~0) (let ((.cse0 (select |c_#memory_int| c_~q~0.base))) (or (not (= (select .cse0 .cse1) 1)) .cse2 .cse3 (let ((.cse4 (+ c_~s~0 (select .cse0 .cse6) (select .cse0 .cse7)))) (and (< .cse4 .cse5) (< |c_thread1Thread1of1ForFork1_~i~0#1| .cse4))))) .cse8 (or (<= c_~n~0 c_~q_back~0) (and .cse8 (<= |c_thread1Thread1of1ForFork1_~i~0#1| c_~s~0))) (or .cse2 .cse3 (and (forall ((v_ArrVal_911 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_911) c_~q~0.base))) (or (< |c_thread1Thread1of1ForFork1_~i~0#1| (+ c_~s~0 (select .cse9 .cse7) (select .cse9 .cse6))) (not (= (select .cse9 .cse1) 1))))) (forall ((v_ArrVal_911 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_911) c_~q~0.base))) (or (< (+ c_~s~0 (select .cse10 .cse7) (select .cse10 .cse6)) .cse5) (not (= (select .cse10 .cse1) 1))))))) (= c_~q~0.offset 0)))) is different from false [2023-01-27 22:46:22,620 INFO L130 PetriNetUnfolder]: 1163/2291 cut-off events. [2023-01-27 22:46:22,620 INFO L131 PetriNetUnfolder]: For 36309/36311 co-relation queries the response was YES. [2023-01-27 22:46:22,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19492 conditions, 2291 events. 1163/2291 cut-off events. For 36309/36311 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 14184 event pairs, 134 based on Foata normal form. 4/2294 useless extension candidates. Maximal degree in co-relation 19403. Up to 1680 conditions per place. [2023-01-27 22:46:22,640 INFO L137 encePairwiseOnDemand]: 237/249 looper letters, 402 selfloop transitions, 166 changer transitions 12/581 dead transitions. [2023-01-27 22:46:22,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 581 transitions, 12399 flow [2023-01-27 22:46:22,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-01-27 22:46:22,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-01-27 22:46:22,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2782 transitions. [2023-01-27 22:46:22,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29401817797505814 [2023-01-27 22:46:22,642 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2782 transitions. [2023-01-27 22:46:22,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2782 transitions. [2023-01-27 22:46:22,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:22,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2782 transitions. [2023-01-27 22:46:22,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 73.21052631578948) internal successors, (2782), 38 states have internal predecessors, (2782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:22,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 249.0) internal successors, (9711), 39 states have internal predecessors, (9711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:22,649 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 249.0) internal successors, (9711), 39 states have internal predecessors, (9711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:22,649 INFO L175 Difference]: Start difference. First operand has 298 places, 460 transitions, 9931 flow. Second operand 38 states and 2782 transitions. [2023-01-27 22:46:22,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 581 transitions, 12399 flow [2023-01-27 22:46:22,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 581 transitions, 11835 flow, removed 175 selfloop flow, removed 31 redundant places. [2023-01-27 22:46:22,874 INFO L231 Difference]: Finished difference. Result has 293 places, 499 transitions, 10855 flow [2023-01-27 22:46:22,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=9459, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=460, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=10855, PETRI_PLACES=293, PETRI_TRANSITIONS=499} [2023-01-27 22:46:22,875 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 272 predicate places. [2023-01-27 22:46:22,875 INFO L495 AbstractCegarLoop]: Abstraction has has 293 places, 499 transitions, 10855 flow [2023-01-27 22:46:22,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 70.52631578947368) internal successors, (2680), 38 states have internal predecessors, (2680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:22,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:22,875 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:22,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-01-27 22:46:23,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:23,080 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:23,080 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:23,081 INFO L85 PathProgramCache]: Analyzing trace with hash -2013102331, now seen corresponding path program 20 times [2023-01-27 22:46:23,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:23,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654180812] [2023-01-27 22:46:23,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:23,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:24,128 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:24,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654180812] [2023-01-27 22:46:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654180812] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406923241] [2023-01-27 22:46:24,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:46:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:24,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:24,130 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:24,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-01-27 22:46:24,225 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:46:24,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:46:24,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 75 conjunts are in the unsatisfiable core [2023-01-27 22:46:24,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:24,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-01-27 22:46:24,305 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2023-01-27 22:46:24,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 22:46:24,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:46:24,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:24,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-01-27 22:46:24,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:24,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 7 [2023-01-27 22:46:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:24,748 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:24,943 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse6 (* c_~q_front~0 4))) (let ((.cse2 (+ .cse6 c_~q~0.offset 4)) (.cse3 (+ .cse6 c_~q~0.offset))) (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (< (+ c_~s~0 .cse0 (select .cse1 .cse2)) (+ c_~N~0 1)) (= .cse0 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (<= c_~N~0 (+ c_~s~0 .cse4 (select .cse5 .cse2))) (= .cse4 0)))))))) (< c_~q_back~0 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0)) is different from false [2023-01-27 22:46:25,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:25,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 122 [2023-01-27 22:46:25,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:25,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 243 treesize of output 237 [2023-01-27 22:46:25,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 114 [2023-01-27 22:46:25,830 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:25,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 115 treesize of output 119 [2023-01-27 22:46:26,313 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:26,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 122 [2023-01-27 22:46:26,317 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-27 22:46:26,328 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:46:26,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 147 treesize of output 113 [2023-01-27 22:46:26,343 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-27 22:46:26,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 62 [2023-01-27 22:46:26,439 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:26,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406923241] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:26,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:26,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-01-27 22:46:26,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218800158] [2023-01-27 22:46:26,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:26,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:46:26,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:26,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:46:26,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1125, Unknown=17, NotChecked=70, Total=1406 [2023-01-27 22:46:26,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:46:26,442 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 499 transitions, 10855 flow. Second operand has 38 states, 38 states have (on average 67.47368421052632) internal successors, (2564), 38 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:26,442 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:26,442 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:46:26,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:29,093 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (* c_~q_front~0 4)) (.cse12 (select |c_#memory_int| c_~q~0.base)) (.cse13 (* 4 c_~q_back~0))) (let ((.cse0 (not (= (select .cse12 (+ c_~q~0.offset .cse13)) 1))) (.cse3 (+ .cse14 c_~q~0.offset 4)) (.cse4 (+ .cse14 c_~q~0.offset))) (and (let ((.cse7 (+ c_~q_back~0 1))) (or .cse0 (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (< (+ c_~s~0 .cse1 (select .cse2 .cse3)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)) (= .cse1 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (= .cse5 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| (+ c_~s~0 .cse5 (select .cse6 .cse3)))))))) (<= c_~n~0 .cse7) (< .cse7 0))) (or .cse0 (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse8 (select .cse9 .cse4))) (or (< (+ c_~s~0 .cse8 (select .cse9 .cse3)) 3) (= .cse8 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse10 (select .cse11 .cse4))) (or (< 1 (+ c_~s~0 .cse10 (select .cse11 .cse3))) (= .cse10 0)))))) (not (= (select .cse12 (+ c_~q~0.offset .cse13 4)) 1)) (< c_~q_back~0 0) (<= c_~n~0 (+ 2 c_~q_back~0)))))) is different from false [2023-01-27 22:46:32,632 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse25 (* c_~q_front~0 4)) (.cse23 (select |c_#memory_int| c_~q~0.base)) (.cse24 (* 4 c_~q_back~0))) (let ((.cse0 (not (= (select .cse23 (+ c_~q~0.offset .cse24)) 1))) (.cse3 (+ .cse25 c_~q~0.offset 4)) (.cse4 (+ .cse25 c_~q~0.offset)) (.cse13 (not (= (select .cse23 (+ c_~q~0.offset .cse24 4)) 1))) (.cse12 (< c_~q_back~0 0)) (.cse18 (<= c_~n~0 (+ 2 c_~q_back~0)))) (and (let ((.cse7 (+ c_~q_back~0 1))) (or .cse0 (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (< (+ c_~s~0 .cse1 (select .cse2 .cse3)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)) (= .cse1 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (= .cse5 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| (+ c_~s~0 .cse5 (select .cse6 .cse3)))))))) (<= c_~n~0 .cse7) (< .cse7 0))) (or (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse8 (select .cse9 .cse4))) (or (< (+ c_~s~0 .cse8 (select .cse9 .cse3)) (+ c_~N~0 1)) (= .cse8 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse10 (select .cse11 .cse4))) (or (<= c_~N~0 (+ c_~s~0 .cse10 (select .cse11 .cse3))) (= .cse10 0)))))) .cse12 (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0)) (or .cse0 .cse13 .cse12 (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse14 (select .cse15 .cse4))) (or (= .cse14 0) (< (+ c_~s~0 .cse14 (select .cse15 .cse3)) (+ 3 |c_thread1Thread1of1ForFork1_~i~0#1|)))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse16 (select .cse17 .cse4))) (or (< (+ |c_thread1Thread1of1ForFork1_~i~0#1| 1) (+ c_~s~0 .cse16 (select .cse17 .cse3))) (= .cse16 0)))))) .cse18) (or .cse0 (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse19 (select .cse20 .cse4))) (or (< (+ c_~s~0 .cse19 (select .cse20 .cse3)) 3) (= .cse19 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse21 (select .cse22 .cse4))) (or (< 1 (+ c_~s~0 .cse21 (select .cse22 .cse3))) (= .cse21 0)))))) .cse13 .cse12 .cse18)))) is different from false [2023-01-27 22:46:33,425 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* c_~q_front~0 4))) (let ((.cse2 (+ .cse11 c_~q~0.offset 4)) (.cse3 (+ .cse11 c_~q~0.offset))) (and (let ((.cse6 (+ c_~q_back~0 1))) (or (not (= (select (select |c_#memory_int| c_~q~0.base) (+ c_~q~0.offset (* 4 c_~q_back~0))) 1)) (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse0 (select .cse1 .cse3))) (or (< (+ c_~s~0 .cse0 (select .cse1 .cse2)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)) (= .cse0 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse4 (select .cse5 .cse3))) (or (= .cse4 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| (+ c_~s~0 .cse4 (select .cse5 .cse2)))))))) (<= c_~n~0 .cse6) (< .cse6 0))) (or (and (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse7 (select .cse8 .cse3))) (or (< (+ c_~s~0 .cse7 (select .cse8 .cse2)) (+ c_~N~0 1)) (= .cse7 0))))) (forall ((v_ArrVal_957 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_957) c_~q~0.base))) (let ((.cse9 (select .cse10 .cse3))) (or (<= c_~N~0 (+ c_~s~0 .cse9 (select .cse10 .cse2))) (= .cse9 0)))))) (< c_~q_back~0 0) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0) (<= c_~n~0 c_~q_back~0))))) is different from false [2023-01-27 22:46:33,974 INFO L130 PetriNetUnfolder]: 1209/2416 cut-off events. [2023-01-27 22:46:33,974 INFO L131 PetriNetUnfolder]: For 40806/40810 co-relation queries the response was YES. [2023-01-27 22:46:33,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20789 conditions, 2416 events. 1209/2416 cut-off events. For 40806/40810 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15401 event pairs, 350 based on Foata normal form. 5/2421 useless extension candidates. Maximal degree in co-relation 20702. Up to 2050 conditions per place. [2023-01-27 22:46:33,993 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 480 selfloop transitions, 127 changer transitions 16/624 dead transitions. [2023-01-27 22:46:33,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 624 transitions, 13500 flow [2023-01-27 22:46:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-01-27 22:46:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-01-27 22:46:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2938 transitions. [2023-01-27 22:46:33,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2809332568368713 [2023-01-27 22:46:33,996 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 2938 transitions. [2023-01-27 22:46:33,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 2938 transitions. [2023-01-27 22:46:33,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:33,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 2938 transitions. [2023-01-27 22:46:33,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 69.95238095238095) internal successors, (2938), 42 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:34,007 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 249.0) internal successors, (10707), 43 states have internal predecessors, (10707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:34,007 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 249.0) internal successors, (10707), 43 states have internal predecessors, (10707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:34,007 INFO L175 Difference]: Start difference. First operand has 293 places, 499 transitions, 10855 flow. Second operand 42 states and 2938 transitions. [2023-01-27 22:46:34,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 624 transitions, 13500 flow [2023-01-27 22:46:34,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 624 transitions, 13208 flow, removed 79 selfloop flow, removed 21 redundant places. [2023-01-27 22:46:34,237 INFO L231 Difference]: Finished difference. Result has 321 places, 550 transitions, 11972 flow [2023-01-27 22:46:34,237 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=10603, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=11972, PETRI_PLACES=321, PETRI_TRANSITIONS=550} [2023-01-27 22:46:34,238 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 300 predicate places. [2023-01-27 22:46:34,238 INFO L495 AbstractCegarLoop]: Abstraction has has 321 places, 550 transitions, 11972 flow [2023-01-27 22:46:34,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 67.47368421052632) internal successors, (2564), 38 states have internal predecessors, (2564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:34,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:34,238 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:34,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-01-27 22:46:34,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-01-27 22:46:34,443 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:34,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:34,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1538767919, now seen corresponding path program 21 times [2023-01-27 22:46:34,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:34,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488837541] [2023-01-27 22:46:34,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:34,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:35,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488837541] [2023-01-27 22:46:35,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488837541] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:35,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408229526] [2023-01-27 22:46:35,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:46:35,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:35,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:35,306 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:35,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-01-27 22:46:35,420 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-27 22:46:35,420 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:46:35,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-27 22:46:35,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:35,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:35,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:46:35,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:46:35,708 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:35,859 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~q_front~0 4))) (let ((.cse1 (+ c_~q~0.offset (* 4 c_~q_back~0))) (.cse2 (+ .cse5 c_~q~0.offset)) (.cse3 (+ .cse5 c_~q~0.offset 4))) (and (forall ((v_ArrVal_996 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_996) c_~q~0.base))) (or (not (= (select .cse0 .cse1) 1)) (< (+ c_~s~0 (select .cse0 .cse2) (select .cse0 .cse3)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|))))) (forall ((v_ArrVal_996 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_996) c_~q~0.base))) (or (not (= (select .cse4 .cse1) 1)) (< |c_thread1Thread1of1ForFork1_~i~0#1| (+ c_~s~0 (select .cse4 .cse2) (select .cse4 .cse3))))))))) is different from false [2023-01-27 22:46:35,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:35,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 170 [2023-01-27 22:46:35,905 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:35,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 128 [2023-01-27 22:46:35,916 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:35,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 108 [2023-01-27 22:46:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:46:36,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408229526] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:36,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:36,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 30 [2023-01-27 22:46:36,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652740312] [2023-01-27 22:46:36,212 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:36,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-27 22:46:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-27 22:46:36,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=847, Unknown=1, NotChecked=58, Total=992 [2023-01-27 22:46:36,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:46:36,215 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 550 transitions, 11972 flow. Second operand has 32 states, 32 states have (on average 70.6875) internal successors, (2262), 32 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:36,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:36,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:46:36,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:37,832 INFO L130 PetriNetUnfolder]: 1283/2547 cut-off events. [2023-01-27 22:46:37,832 INFO L131 PetriNetUnfolder]: For 50129/50130 co-relation queries the response was YES. [2023-01-27 22:46:37,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24053 conditions, 2547 events. 1283/2547 cut-off events. For 50129/50130 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 16095 event pairs, 289 based on Foata normal form. 6/2553 useless extension candidates. Maximal degree in co-relation 23955. Up to 1940 conditions per place. [2023-01-27 22:46:37,854 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 453 selfloop transitions, 142 changer transitions 51/647 dead transitions. [2023-01-27 22:46:37,854 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 647 transitions, 14677 flow [2023-01-27 22:46:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 22:46:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 22:46:37,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1977 transitions. [2023-01-27 22:46:37,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2940651494868362 [2023-01-27 22:46:37,856 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1977 transitions. [2023-01-27 22:46:37,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1977 transitions. [2023-01-27 22:46:37,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:37,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1977 transitions. [2023-01-27 22:46:37,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 73.22222222222223) internal successors, (1977), 27 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:37,860 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 249.0) internal successors, (6972), 28 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:37,861 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 249.0) internal successors, (6972), 28 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:37,861 INFO L175 Difference]: Start difference. First operand has 321 places, 550 transitions, 11972 flow. Second operand 27 states and 1977 transitions. [2023-01-27 22:46:37,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 647 transitions, 14677 flow [2023-01-27 22:46:38,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 647 transitions, 14497 flow, removed 61 selfloop flow, removed 19 redundant places. [2023-01-27 22:46:38,140 INFO L231 Difference]: Finished difference. Result has 334 places, 570 transitions, 12660 flow [2023-01-27 22:46:38,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=11782, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=12660, PETRI_PLACES=334, PETRI_TRANSITIONS=570} [2023-01-27 22:46:38,141 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 313 predicate places. [2023-01-27 22:46:38,141 INFO L495 AbstractCegarLoop]: Abstraction has has 334 places, 570 transitions, 12660 flow [2023-01-27 22:46:38,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 70.6875) internal successors, (2262), 32 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:38,141 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:38,141 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:38,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-01-27 22:46:38,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-01-27 22:46:38,346 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:38,347 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash -540806737, now seen corresponding path program 22 times [2023-01-27 22:46:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936726130] [2023-01-27 22:46:38,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:38,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:39,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:39,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936726130] [2023-01-27 22:46:39,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936726130] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:39,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712988859] [2023-01-27 22:46:39,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:46:39,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:39,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:39,135 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:39,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-01-27 22:46:39,252 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:46:39,253 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:46:39,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 69 conjunts are in the unsatisfiable core [2023-01-27 22:46:39,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:39,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:39,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-27 22:46:39,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:39,740 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:39,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 20 [2023-01-27 22:46:39,841 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:39,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:40,236 INFO L321 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-01-27 22:46:40,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 190 treesize of output 168 [2023-01-27 22:46:40,254 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:40,254 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 127 treesize of output 127 [2023-01-27 22:46:40,267 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:40,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 108 [2023-01-27 22:46:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:41,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712988859] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:41,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-01-27 22:46:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408357357] [2023-01-27 22:46:41,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:46:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:46:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1195, Unknown=6, NotChecked=0, Total=1406 [2023-01-27 22:46:41,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:46:41,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 570 transitions, 12660 flow. Second operand has 38 states, 38 states have (on average 67.52631578947368) internal successors, (2566), 38 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:41,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:41,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:46:41,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:43,055 INFO L130 PetriNetUnfolder]: 1208/2377 cut-off events. [2023-01-27 22:46:43,055 INFO L131 PetriNetUnfolder]: For 51846/51850 co-relation queries the response was YES. [2023-01-27 22:46:43,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23278 conditions, 2377 events. 1208/2377 cut-off events. For 51846/51850 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14629 event pairs, 308 based on Foata normal form. 5/2367 useless extension candidates. Maximal degree in co-relation 23170. Up to 1460 conditions per place. [2023-01-27 22:46:43,078 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 380 selfloop transitions, 194 changer transitions 20/595 dead transitions. [2023-01-27 22:46:43,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 595 transitions, 13999 flow [2023-01-27 22:46:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-27 22:46:43,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-27 22:46:43,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1332 transitions. [2023-01-27 22:46:43,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28154724159797084 [2023-01-27 22:46:43,080 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1332 transitions. [2023-01-27 22:46:43,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1332 transitions. [2023-01-27 22:46:43,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:43,080 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1332 transitions. [2023-01-27 22:46:43,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 70.10526315789474) internal successors, (1332), 19 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:43,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 249.0) internal successors, (4980), 20 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:43,083 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 249.0) internal successors, (4980), 20 states have internal predecessors, (4980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:43,083 INFO L175 Difference]: Start difference. First operand has 334 places, 570 transitions, 12660 flow. Second operand 19 states and 1332 transitions. [2023-01-27 22:46:43,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 595 transitions, 13999 flow [2023-01-27 22:46:43,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 595 transitions, 13485 flow, removed 83 selfloop flow, removed 26 redundant places. [2023-01-27 22:46:43,375 INFO L231 Difference]: Finished difference. Result has 311 places, 554 transitions, 12148 flow [2023-01-27 22:46:43,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12068, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=566, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=194, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12148, PETRI_PLACES=311, PETRI_TRANSITIONS=554} [2023-01-27 22:46:43,376 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 290 predicate places. [2023-01-27 22:46:43,376 INFO L495 AbstractCegarLoop]: Abstraction has has 311 places, 554 transitions, 12148 flow [2023-01-27 22:46:43,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 67.52631578947368) internal successors, (2566), 38 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:43,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:43,377 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:43,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-01-27 22:46:43,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-01-27 22:46:43,582 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:43,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:43,582 INFO L85 PathProgramCache]: Analyzing trace with hash 996292129, now seen corresponding path program 23 times [2023-01-27 22:46:43,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:43,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682075206] [2023-01-27 22:46:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:43,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:44,223 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:44,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:44,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682075206] [2023-01-27 22:46:44,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682075206] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574134808] [2023-01-27 22:46:44,224 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:46:44,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:44,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:44,225 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:44,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-01-27 22:46:44,328 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:46:44,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:46:44,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-27 22:46:44,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:44,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:44,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-01-27 22:46:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:46:44,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:44,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:44,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 124 [2023-01-27 22:46:44,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:44,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 66 [2023-01-27 22:46:44,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:44,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 53 [2023-01-27 22:46:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-27 22:46:44,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574134808] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:44,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:44,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 30 [2023-01-27 22:46:44,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218760800] [2023-01-27 22:46:44,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:44,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-27 22:46:44,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:44,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-27 22:46:44,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=903, Unknown=2, NotChecked=0, Total=992 [2023-01-27 22:46:44,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:46:44,943 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 554 transitions, 12148 flow. Second operand has 32 states, 32 states have (on average 70.6875) internal successors, (2262), 32 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:44,943 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:44,943 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:46:44,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:46,429 INFO L130 PetriNetUnfolder]: 1223/2404 cut-off events. [2023-01-27 22:46:46,429 INFO L131 PetriNetUnfolder]: For 48196/48196 co-relation queries the response was YES. [2023-01-27 22:46:46,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 2404 events. 1223/2404 cut-off events. For 48196/48196 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14949 event pairs, 74 based on Foata normal form. 3/2407 useless extension candidates. Maximal degree in co-relation 23112. Up to 1754 conditions per place. [2023-01-27 22:46:46,450 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 429 selfloop transitions, 155 changer transitions 24/609 dead transitions. [2023-01-27 22:46:46,450 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 609 transitions, 13973 flow [2023-01-27 22:46:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-01-27 22:46:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-01-27 22:46:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1825 transitions. [2023-01-27 22:46:46,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2931726907630522 [2023-01-27 22:46:46,454 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1825 transitions. [2023-01-27 22:46:46,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1825 transitions. [2023-01-27 22:46:46,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:46,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1825 transitions. [2023-01-27 22:46:46,456 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 73.0) internal successors, (1825), 25 states have internal predecessors, (1825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:46,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:46,459 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:46,459 INFO L175 Difference]: Start difference. First operand has 311 places, 554 transitions, 12148 flow. Second operand 25 states and 1825 transitions. [2023-01-27 22:46:46,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 609 transitions, 13973 flow [2023-01-27 22:46:46,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 609 transitions, 13541 flow, removed 35 selfloop flow, removed 15 redundant places. [2023-01-27 22:46:46,884 INFO L231 Difference]: Finished difference. Result has 312 places, 556 transitions, 12187 flow [2023-01-27 22:46:46,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=11707, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=12187, PETRI_PLACES=312, PETRI_TRANSITIONS=556} [2023-01-27 22:46:46,885 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 291 predicate places. [2023-01-27 22:46:46,885 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 556 transitions, 12187 flow [2023-01-27 22:46:46,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 70.6875) internal successors, (2262), 32 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:46,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:46,886 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:46,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-01-27 22:46:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:47,091 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:47,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash 2012228394, now seen corresponding path program 24 times [2023-01-27 22:46:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5570642] [2023-01-27 22:46:47,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:47,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:48,450 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5570642] [2023-01-27 22:46:48,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5570642] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:48,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597171275] [2023-01-27 22:46:48,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:46:48,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:48,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:48,456 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:48,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-01-27 22:46:48,565 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:46:48,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:46:48,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-27 22:46:48,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:48,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:48,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2023-01-27 22:46:49,039 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:46:49,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:49,224 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~q_front~0 4))) (let ((.cse3 (+ .cse8 c_~q~0.offset)) (.cse4 (+ .cse8 c_~q~0.offset 4))) (and (forall ((v_ArrVal_1117 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1117) c_~q~0.base))) (let ((.cse0 (select .cse2 .cse4)) (.cse1 (select .cse2 .cse3))) (or (= .cse0 0) (= 0 .cse1) (<= c_~N~0 (+ c_~s~0 .cse0 .cse1)))))) (forall ((v_ArrVal_1117 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1117) c_~q~0.base))) (let ((.cse5 (select .cse7 .cse4)) (.cse6 (select .cse7 .cse3))) (or (= .cse5 0) (= 0 .cse6) (< (+ c_~s~0 .cse5 .cse6) (+ c_~N~0 1))))))))) is different from false [2023-01-27 22:46:49,417 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:49,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 210 [2023-01-27 22:46:49,426 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:49,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 165 treesize of output 139 [2023-01-27 22:46:49,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:49,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 113 [2023-01-27 22:46:49,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:46:49,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597171275] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:49,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:49,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2023-01-27 22:46:49,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954128608] [2023-01-27 22:46:49,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:49,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-27 22:46:49,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-27 22:46:49,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1034, Unknown=1, NotChecked=64, Total=1190 [2023-01-27 22:46:49,628 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:46:49,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 556 transitions, 12187 flow. Second operand has 35 states, 35 states have (on average 70.62857142857143) internal successors, (2472), 35 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:49,630 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:49,630 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:46:49,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:46:51,486 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~q_front~0 4))) (let ((.cse5 (+ .cse10 c_~q~0.offset)) (.cse6 (+ .cse10 c_~q~0.offset 4))) (let ((.cse0 (forall ((v_ArrVal_1117 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1117) c_~q~0.base))) (let ((.cse7 (select .cse9 .cse6)) (.cse8 (select .cse9 .cse5))) (or (= .cse7 0) (= 0 .cse8) (<= c_~N~0 (+ c_~s~0 .cse7 .cse8))))))) (.cse1 (forall ((v_ArrVal_1117 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1117) c_~q~0.base))) (let ((.cse2 (select .cse4 .cse6)) (.cse3 (select .cse4 .cse5))) (or (= .cse2 0) (= 0 .cse3) (< (+ c_~s~0 .cse2 .cse3) (+ c_~N~0 1)))))))) (and (or (and .cse0 .cse1) (< |c_thread1Thread1of1ForFork1_~i~0#1| c_~N~0)) .cse0 .cse1)))) is different from false [2023-01-27 22:46:52,064 INFO L130 PetriNetUnfolder]: 1222/2407 cut-off events. [2023-01-27 22:46:52,064 INFO L131 PetriNetUnfolder]: For 51587/51588 co-relation queries the response was YES. [2023-01-27 22:46:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23287 conditions, 2407 events. 1222/2407 cut-off events. For 51587/51588 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 15080 event pairs, 87 based on Foata normal form. 7/2414 useless extension candidates. Maximal degree in co-relation 23185. Up to 1777 conditions per place. [2023-01-27 22:46:52,086 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 447 selfloop transitions, 167 changer transitions 4/619 dead transitions. [2023-01-27 22:46:52,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 619 transitions, 14128 flow [2023-01-27 22:46:52,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-27 22:46:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-27 22:46:52,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1973 transitions. [2023-01-27 22:46:52,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29347017700431355 [2023-01-27 22:46:52,088 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1973 transitions. [2023-01-27 22:46:52,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1973 transitions. [2023-01-27 22:46:52,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:46:52,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1973 transitions. [2023-01-27 22:46:52,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 73.07407407407408) internal successors, (1973), 27 states have internal predecessors, (1973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:52,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 249.0) internal successors, (6972), 28 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:52,092 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 249.0) internal successors, (6972), 28 states have internal predecessors, (6972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:52,092 INFO L175 Difference]: Start difference. First operand has 312 places, 556 transitions, 12187 flow. Second operand 27 states and 1973 transitions. [2023-01-27 22:46:52,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 619 transitions, 14128 flow [2023-01-27 22:46:52,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 619 transitions, 13807 flow, removed 20 selfloop flow, removed 21 redundant places. [2023-01-27 22:46:52,342 INFO L231 Difference]: Finished difference. Result has 312 places, 573 transitions, 12539 flow [2023-01-27 22:46:52,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=11868, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=12539, PETRI_PLACES=312, PETRI_TRANSITIONS=573} [2023-01-27 22:46:52,343 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 291 predicate places. [2023-01-27 22:46:52,343 INFO L495 AbstractCegarLoop]: Abstraction has has 312 places, 573 transitions, 12539 flow [2023-01-27 22:46:52,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 70.62857142857143) internal successors, (2472), 35 states have internal predecessors, (2472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:52,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:46:52,343 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:46:52,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-01-27 22:46:52,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:52,548 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:46:52,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:46:52,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1390105946, now seen corresponding path program 25 times [2023-01-27 22:46:52,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:46:52,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018953992] [2023-01-27 22:46:52,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:46:52,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:46:52,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:53,815 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:46:53,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:46:53,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018953992] [2023-01-27 22:46:53,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018953992] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:46:53,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614609775] [2023-01-27 22:46:53,816 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:46:53,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:46:53,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:46:53,817 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:46:53,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-01-27 22:46:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:46:53,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 56 conjunts are in the unsatisfiable core [2023-01-27 22:46:53,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:46:54,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:46:54,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-27 22:46:54,264 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:46:54,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:46:54,471 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q_front~0 4))) (let ((.cse3 (+ .cse7 c_~q~0.offset 4)) (.cse2 (+ c_~q~0.offset (* 4 c_~q_back~0))) (.cse4 (+ .cse7 c_~q~0.offset))) (and (forall ((v_ArrVal_1160 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) c_~q~0.base))) (let ((.cse0 (select .cse1 .cse4))) (or (= .cse0 0) (not (= (select .cse1 .cse2) 1)) (< (+ c_~s~0 .cse0 (select .cse1 .cse3)) (+ 2 |c_thread1Thread1of1ForFork1_~i~0#1|)))))) (forall ((v_ArrVal_1160 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1160) c_~q~0.base))) (let ((.cse5 (select .cse6 .cse4))) (or (< |c_thread1Thread1of1ForFork1_~i~0#1| (+ c_~s~0 .cse5 (select .cse6 .cse3))) (= .cse5 0) (not (= (select .cse6 .cse2) 1))))))))) is different from false [2023-01-27 22:46:54,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:54,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 252 treesize of output 212 [2023-01-27 22:46:54,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:54,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 164 [2023-01-27 22:46:54,523 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:46:54,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 145 treesize of output 138 [2023-01-27 22:46:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:46:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614609775] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:46:54,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:46:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2023-01-27 22:46:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944309121] [2023-01-27 22:46:54,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:46:54,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-01-27 22:46:54,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:46:54,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-01-27 22:46:54,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1034, Unknown=1, NotChecked=64, Total=1190 [2023-01-27 22:46:54,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 249 [2023-01-27 22:46:54,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 573 transitions, 12539 flow. Second operand has 35 states, 35 states have (on average 70.6) internal successors, (2471), 35 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:46:54,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:46:54,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 249 [2023-01-27 22:46:54,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:01,907 INFO L130 PetriNetUnfolder]: 1299/2598 cut-off events. [2023-01-27 22:47:01,907 INFO L131 PetriNetUnfolder]: For 59286/59286 co-relation queries the response was YES. [2023-01-27 22:47:01,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25827 conditions, 2598 events. 1299/2598 cut-off events. For 59286/59286 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 16777 event pairs, 347 based on Foata normal form. 6/2604 useless extension candidates. Maximal degree in co-relation 25724. Up to 2217 conditions per place. [2023-01-27 22:47:01,930 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 527 selfloop transitions, 113 changer transitions 30/671 dead transitions. [2023-01-27 22:47:01,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 671 transitions, 15476 flow [2023-01-27 22:47:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-01-27 22:47:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-01-27 22:47:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2403 transitions. [2023-01-27 22:47:01,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.29244249726177435 [2023-01-27 22:47:01,933 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2403 transitions. [2023-01-27 22:47:01,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2403 transitions. [2023-01-27 22:47:01,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:01,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2403 transitions. [2023-01-27 22:47:01,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 72.81818181818181) internal successors, (2403), 33 states have internal predecessors, (2403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:01,947 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 249.0) internal successors, (8466), 34 states have internal predecessors, (8466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:01,947 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 249.0) internal successors, (8466), 34 states have internal predecessors, (8466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:01,947 INFO L175 Difference]: Start difference. First operand has 312 places, 573 transitions, 12539 flow. Second operand 33 states and 2403 transitions. [2023-01-27 22:47:01,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 671 transitions, 15476 flow [2023-01-27 22:47:02,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 671 transitions, 15088 flow, removed 69 selfloop flow, removed 16 redundant places. [2023-01-27 22:47:02,234 INFO L231 Difference]: Finished difference. Result has 333 places, 603 transitions, 13100 flow [2023-01-27 22:47:02,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12163, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=89, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=482, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=13100, PETRI_PLACES=333, PETRI_TRANSITIONS=603} [2023-01-27 22:47:02,235 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 312 predicate places. [2023-01-27 22:47:02,235 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 603 transitions, 13100 flow [2023-01-27 22:47:02,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 70.6) internal successors, (2471), 35 states have internal predecessors, (2471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:02,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:02,235 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:02,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:02,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:02,436 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:02,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1090626796, now seen corresponding path program 26 times [2023-01-27 22:47:02,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:02,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943359165] [2023-01-27 22:47:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:02,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:47:02,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943359165] [2023-01-27 22:47:02,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943359165] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:02,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161581885] [2023-01-27 22:47:02,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:47:02,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:02,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:02,576 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:02,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-01-27 22:47:02,680 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:47:02,680 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:02,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 22:47:02,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:47:02,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:02,875 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-27 22:47:02,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161581885] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:02,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:02,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2023-01-27 22:47:02,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095563819] [2023-01-27 22:47:02,875 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:02,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-27 22:47:02,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:02,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-27 22:47:02,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2023-01-27 22:47:02,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 249 [2023-01-27 22:47:02,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 603 transitions, 13100 flow. Second operand has 24 states, 24 states have (on average 97.91666666666667) internal successors, (2350), 24 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:02,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:02,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 249 [2023-01-27 22:47:02,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:03,352 INFO L130 PetriNetUnfolder]: 847/1708 cut-off events. [2023-01-27 22:47:03,352 INFO L131 PetriNetUnfolder]: For 43684/43688 co-relation queries the response was YES. [2023-01-27 22:47:03,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17247 conditions, 1708 events. 847/1708 cut-off events. For 43684/43688 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10440 event pairs, 331 based on Foata normal form. 23/1709 useless extension candidates. Maximal degree in co-relation 17138. Up to 1622 conditions per place. [2023-01-27 22:47:03,370 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 355 selfloop transitions, 5 changer transitions 25/394 dead transitions. [2023-01-27 22:47:03,370 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 394 transitions, 9372 flow [2023-01-27 22:47:03,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-01-27 22:47:03,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-01-27 22:47:03,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 993 transitions. [2023-01-27 22:47:03,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39879518072289155 [2023-01-27 22:47:03,371 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 993 transitions. [2023-01-27 22:47:03,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 993 transitions. [2023-01-27 22:47:03,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:03,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 993 transitions. [2023-01-27 22:47:03,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 99.3) internal successors, (993), 10 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:03,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:03,373 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:03,373 INFO L175 Difference]: Start difference. First operand has 333 places, 603 transitions, 13100 flow. Second operand 10 states and 993 transitions. [2023-01-27 22:47:03,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 394 transitions, 9372 flow [2023-01-27 22:47:03,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 394 transitions, 8449 flow, removed 60 selfloop flow, removed 61 redundant places. [2023-01-27 22:47:03,564 INFO L231 Difference]: Finished difference. Result has 246 places, 369 transitions, 7414 flow [2023-01-27 22:47:03,564 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=7648, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=389, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7414, PETRI_PLACES=246, PETRI_TRANSITIONS=369} [2023-01-27 22:47:03,564 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 225 predicate places. [2023-01-27 22:47:03,565 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 369 transitions, 7414 flow [2023-01-27 22:47:03,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 97.91666666666667) internal successors, (2350), 24 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:03,565 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:03,565 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:03,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:03,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-01-27 22:47:03,770 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:03,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 46362306, now seen corresponding path program 27 times [2023-01-27 22:47:03,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:03,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59473337] [2023-01-27 22:47:03,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:04,102 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:04,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59473337] [2023-01-27 22:47:04,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59473337] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450764609] [2023-01-27 22:47:04,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:47:04,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:04,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:04,104 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:04,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-01-27 22:47:04,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 22:47:04,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:04,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 45 conjunts are in the unsatisfiable core [2023-01-27 22:47:04,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:04,770 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:04,927 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 22:47:04,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-01-27 22:47:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:05,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450764609] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:05,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:05,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2023-01-27 22:47:05,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422288742] [2023-01-27 22:47:05,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:05,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:47:05,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:05,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:47:05,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1160, Unknown=0, NotChecked=0, Total=1406 [2023-01-27 22:47:05,283 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 249 [2023-01-27 22:47:05,284 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 369 transitions, 7414 flow. Second operand has 38 states, 38 states have (on average 85.55263157894737) internal successors, (3251), 38 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:05,284 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:05,284 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 249 [2023-01-27 22:47:05,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:09,028 INFO L130 PetriNetUnfolder]: 1844/3484 cut-off events. [2023-01-27 22:47:09,028 INFO L131 PetriNetUnfolder]: For 59894/59901 co-relation queries the response was YES. [2023-01-27 22:47:09,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30418 conditions, 3484 events. 1844/3484 cut-off events. For 59894/59901 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 22890 event pairs, 101 based on Foata normal form. 220/3703 useless extension candidates. Maximal degree in co-relation 30326. Up to 1701 conditions per place. [2023-01-27 22:47:09,059 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 380 selfloop transitions, 606 changer transitions 7/1002 dead transitions. [2023-01-27 22:47:09,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1002 transitions, 18100 flow [2023-01-27 22:47:09,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2023-01-27 22:47:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2023-01-27 22:47:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 7671 transitions. [2023-01-27 22:47:09,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36243798724309 [2023-01-27 22:47:09,083 INFO L72 ComplementDD]: Start complementDD. Operand 85 states and 7671 transitions. [2023-01-27 22:47:09,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 7671 transitions. [2023-01-27 22:47:09,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:09,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 85 states and 7671 transitions. [2023-01-27 22:47:09,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 86 states, 85 states have (on average 90.24705882352941) internal successors, (7671), 85 states have internal predecessors, (7671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:09,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 86 states, 86 states have (on average 249.0) internal successors, (21414), 86 states have internal predecessors, (21414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:09,113 INFO L81 ComplementDD]: Finished complementDD. Result has 86 states, 86 states have (on average 249.0) internal successors, (21414), 86 states have internal predecessors, (21414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:09,113 INFO L175 Difference]: Start difference. First operand has 246 places, 369 transitions, 7414 flow. Second operand 85 states and 7671 transitions. [2023-01-27 22:47:09,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1002 transitions, 18100 flow [2023-01-27 22:47:09,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 1002 transitions, 17857 flow, removed 109 selfloop flow, removed 12 redundant places. [2023-01-27 22:47:09,596 INFO L231 Difference]: Finished difference. Result has 303 places, 757 transitions, 15770 flow [2023-01-27 22:47:09,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=7367, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=271, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=15770, PETRI_PLACES=303, PETRI_TRANSITIONS=757} [2023-01-27 22:47:09,596 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 282 predicate places. [2023-01-27 22:47:09,596 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 757 transitions, 15770 flow [2023-01-27 22:47:09,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 85.55263157894737) internal successors, (3251), 38 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:09,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:09,597 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:09,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:09,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:09,803 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:09,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:09,804 INFO L85 PathProgramCache]: Analyzing trace with hash 624582181, now seen corresponding path program 28 times [2023-01-27 22:47:09,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:09,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799834432] [2023-01-27 22:47:09,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:09,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:09,896 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:47:09,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799834432] [2023-01-27 22:47:09,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799834432] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:09,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075628928] [2023-01-27 22:47:09,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:47:09,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:09,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:09,897 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:09,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-01-27 22:47:10,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:47:10,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:10,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-27 22:47:10,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:47:10,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:10,131 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-01-27 22:47:10,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075628928] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:10,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:10,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 8] total 12 [2023-01-27 22:47:10,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648818786] [2023-01-27 22:47:10,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:10,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-27 22:47:10,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:10,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-27 22:47:10,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2023-01-27 22:47:10,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 249 [2023-01-27 22:47:10,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 757 transitions, 15770 flow. Second operand has 13 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:10,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:10,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 249 [2023-01-27 22:47:10,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:11,226 INFO L130 PetriNetUnfolder]: 2145/4069 cut-off events. [2023-01-27 22:47:11,227 INFO L131 PetriNetUnfolder]: For 66092/66098 co-relation queries the response was YES. [2023-01-27 22:47:11,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37666 conditions, 4069 events. 2145/4069 cut-off events. For 66092/66098 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 27679 event pairs, 151 based on Foata normal form. 29/4096 useless extension candidates. Maximal degree in co-relation 37570. Up to 2061 conditions per place. [2023-01-27 22:47:11,264 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 441 selfloop transitions, 389 changer transitions 61/900 dead transitions. [2023-01-27 22:47:11,264 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 900 transitions, 20060 flow [2023-01-27 22:47:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-01-27 22:47:11,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-01-27 22:47:11,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2023-01-27 22:47:11,265 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47322623828647925 [2023-01-27 22:47:11,265 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2023-01-27 22:47:11,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2023-01-27 22:47:11,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:11,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2023-01-27 22:47:11,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:11,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:11,267 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:11,267 INFO L175 Difference]: Start difference. First operand has 303 places, 757 transitions, 15770 flow. Second operand 6 states and 707 transitions. [2023-01-27 22:47:11,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 900 transitions, 20060 flow [2023-01-27 22:47:11,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 900 transitions, 16385 flow, removed 1799 selfloop flow, removed 8 redundant places. [2023-01-27 22:47:11,886 INFO L231 Difference]: Finished difference. Result has 304 places, 815 transitions, 14772 flow [2023-01-27 22:47:11,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12480, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=757, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=14772, PETRI_PLACES=304, PETRI_TRANSITIONS=815} [2023-01-27 22:47:11,886 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 283 predicate places. [2023-01-27 22:47:11,886 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 815 transitions, 14772 flow [2023-01-27 22:47:11,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 110.46153846153847) internal successors, (1436), 13 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:11,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:11,887 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:11,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:12,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:12,087 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:12,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:12,088 INFO L85 PathProgramCache]: Analyzing trace with hash 632124514, now seen corresponding path program 29 times [2023-01-27 22:47:12,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:12,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874304035] [2023-01-27 22:47:12,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:12,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:12,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874304035] [2023-01-27 22:47:12,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874304035] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:12,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190058186] [2023-01-27 22:47:12,536 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-27 22:47:12,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:12,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:12,537 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:12,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-01-27 22:47:12,663 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-27 22:47:12,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:12,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-27 22:47:12,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:12,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:47:12,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-27 22:47:12,902 INFO L321 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2023-01-27 22:47:12,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2023-01-27 22:47:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-27 22:47:12,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:13,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:47:13,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 37 [2023-01-27 22:47:13,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2023-01-27 22:47:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190058186] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:13,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 37 [2023-01-27 22:47:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834129477] [2023-01-27 22:47:13,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:13,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-01-27 22:47:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-01-27 22:47:13,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1209, Unknown=1, NotChecked=0, Total=1406 [2023-01-27 22:47:13,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:47:13,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 815 transitions, 14772 flow. Second operand has 38 states, 38 states have (on average 81.42105263157895) internal successors, (3094), 38 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:13,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:13,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:47:13,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:16,036 INFO L130 PetriNetUnfolder]: 1809/3562 cut-off events. [2023-01-27 22:47:16,036 INFO L131 PetriNetUnfolder]: For 54722/54729 co-relation queries the response was YES. [2023-01-27 22:47:16,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29958 conditions, 3562 events. 1809/3562 cut-off events. For 54722/54729 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 23442 event pairs, 357 based on Foata normal form. 206/3741 useless extension candidates. Maximal degree in co-relation 29858. Up to 1636 conditions per place. [2023-01-27 22:47:16,066 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 616 selfloop transitions, 192 changer transitions 73/890 dead transitions. [2023-01-27 22:47:16,066 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 890 transitions, 17358 flow [2023-01-27 22:47:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-01-27 22:47:16,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2023-01-27 22:47:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2612 transitions. [2023-01-27 22:47:16,068 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3383858012695945 [2023-01-27 22:47:16,068 INFO L72 ComplementDD]: Start complementDD. Operand 31 states and 2612 transitions. [2023-01-27 22:47:16,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 2612 transitions. [2023-01-27 22:47:16,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:16,068 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2612 transitions. [2023-01-27 22:47:16,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 32 states, 31 states have (on average 84.25806451612904) internal successors, (2612), 31 states have internal predecessors, (2612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:16,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 32 states, 32 states have (on average 249.0) internal successors, (7968), 32 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:16,073 INFO L81 ComplementDD]: Finished complementDD. Result has 32 states, 32 states have (on average 249.0) internal successors, (7968), 32 states have internal predecessors, (7968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:16,073 INFO L175 Difference]: Start difference. First operand has 304 places, 815 transitions, 14772 flow. Second operand 31 states and 2612 transitions. [2023-01-27 22:47:16,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 890 transitions, 17358 flow [2023-01-27 22:47:16,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 890 transitions, 16733 flow, removed 301 selfloop flow, removed 4 redundant places. [2023-01-27 22:47:16,467 INFO L231 Difference]: Finished difference. Result has 333 places, 741 transitions, 14082 flow [2023-01-27 22:47:16,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=13310, PETRI_DIFFERENCE_MINUEND_PLACES=289, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=14082, PETRI_PLACES=333, PETRI_TRANSITIONS=741} [2023-01-27 22:47:16,467 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 312 predicate places. [2023-01-27 22:47:16,467 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 741 transitions, 14082 flow [2023-01-27 22:47:16,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 81.42105263157895) internal successors, (3094), 38 states have internal predecessors, (3094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:16,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:16,468 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:16,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2023-01-27 22:47:16,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-01-27 22:47:16,672 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:16,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:16,672 INFO L85 PathProgramCache]: Analyzing trace with hash -84686264, now seen corresponding path program 30 times [2023-01-27 22:47:16,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:16,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091134983] [2023-01-27 22:47:16,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:16,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:17,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:17,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091134983] [2023-01-27 22:47:17,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091134983] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:17,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595181303] [2023-01-27 22:47:17,241 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-27 22:47:17,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:17,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:17,242 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:17,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-01-27 22:47:17,362 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-27 22:47:17,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:17,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2023-01-27 22:47:17,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:17,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:47:17,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:47:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:17,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:18,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:47:18,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-01-27 22:47:18,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-27 22:47:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595181303] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:18,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2023-01-27 22:47:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883621634] [2023-01-27 22:47:18,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:18,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-27 22:47:18,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:18,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-27 22:47:18,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1436, Unknown=3, NotChecked=0, Total=1640 [2023-01-27 22:47:18,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 249 [2023-01-27 22:47:18,617 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 741 transitions, 14082 flow. Second operand has 41 states, 41 states have (on average 78.4390243902439) internal successors, (3216), 41 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:18,617 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:18,617 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 249 [2023-01-27 22:47:18,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:22,526 INFO L130 PetriNetUnfolder]: 2388/4554 cut-off events. [2023-01-27 22:47:22,527 INFO L131 PetriNetUnfolder]: For 62549/62556 co-relation queries the response was YES. [2023-01-27 22:47:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36378 conditions, 4554 events. 2388/4554 cut-off events. For 62549/62556 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 29152 event pairs, 305 based on Foata normal form. 42/4531 useless extension candidates. Maximal degree in co-relation 36267. Up to 1636 conditions per place. [2023-01-27 22:47:22,565 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 566 selfloop transitions, 602 changer transitions 0/1177 dead transitions. [2023-01-27 22:47:22,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1177 transitions, 21251 flow [2023-01-27 22:47:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-01-27 22:47:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-01-27 22:47:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2815 transitions. [2023-01-27 22:47:22,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3325064965745334 [2023-01-27 22:47:22,568 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2815 transitions. [2023-01-27 22:47:22,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2815 transitions. [2023-01-27 22:47:22,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:22,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2815 transitions. [2023-01-27 22:47:22,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 82.79411764705883) internal successors, (2815), 34 states have internal predecessors, (2815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:22,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 249.0) internal successors, (8715), 35 states have internal predecessors, (8715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:22,573 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 249.0) internal successors, (8715), 35 states have internal predecessors, (8715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:22,573 INFO L175 Difference]: Start difference. First operand has 333 places, 741 transitions, 14082 flow. Second operand 34 states and 2815 transitions. [2023-01-27 22:47:22,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 1177 transitions, 21251 flow [2023-01-27 22:47:23,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 1177 transitions, 20480 flow, removed 359 selfloop flow, removed 16 redundant places. [2023-01-27 22:47:23,077 INFO L231 Difference]: Finished difference. Result has 355 places, 1066 transitions, 19416 flow [2023-01-27 22:47:23,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=13631, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=741, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=312, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=19416, PETRI_PLACES=355, PETRI_TRANSITIONS=1066} [2023-01-27 22:47:23,078 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 334 predicate places. [2023-01-27 22:47:23,078 INFO L495 AbstractCegarLoop]: Abstraction has has 355 places, 1066 transitions, 19416 flow [2023-01-27 22:47:23,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 78.4390243902439) internal successors, (3216), 41 states have internal predecessors, (3216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:23,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:23,079 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:23,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:23,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-01-27 22:47:23,283 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:23,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:23,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1432824706, now seen corresponding path program 31 times [2023-01-27 22:47:23,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:23,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058362159] [2023-01-27 22:47:23,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:23,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:23,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:23,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058362159] [2023-01-27 22:47:23,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058362159] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:23,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012422304] [2023-01-27 22:47:23,928 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-27 22:47:23,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:23,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:23,929 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:23,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-01-27 22:47:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:24,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 37 conjunts are in the unsatisfiable core [2023-01-27 22:47:24,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:24,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:47:24,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-01-27 22:47:24,462 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:24,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:24,636 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:47:24,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-01-27 22:47:24,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-27 22:47:25,161 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:25,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012422304] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:25,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:25,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2023-01-27 22:47:25,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834912410] [2023-01-27 22:47:25,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:25,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-27 22:47:25,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:25,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-27 22:47:25,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1345, Unknown=1, NotChecked=0, Total=1560 [2023-01-27 22:47:25,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:47:25,164 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 1066 transitions, 19416 flow. Second operand has 40 states, 40 states have (on average 81.325) internal successors, (3253), 40 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:25,164 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:25,164 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:47:25,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:29,060 INFO L130 PetriNetUnfolder]: 2917/5477 cut-off events. [2023-01-27 22:47:29,060 INFO L131 PetriNetUnfolder]: For 72059/72066 co-relation queries the response was YES. [2023-01-27 22:47:29,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45251 conditions, 5477 events. 2917/5477 cut-off events. For 72059/72066 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 35129 event pairs, 300 based on Foata normal form. 38/5498 useless extension candidates. Maximal degree in co-relation 45136. Up to 1636 conditions per place. [2023-01-27 22:47:29,197 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 636 selfloop transitions, 776 changer transitions 0/1421 dead transitions. [2023-01-27 22:47:29,197 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 1421 transitions, 27186 flow [2023-01-27 22:47:29,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-01-27 22:47:29,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-01-27 22:47:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2739 transitions. [2023-01-27 22:47:29,199 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34375 [2023-01-27 22:47:29,199 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2739 transitions. [2023-01-27 22:47:29,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2739 transitions. [2023-01-27 22:47:29,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:29,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2739 transitions. [2023-01-27 22:47:29,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 85.59375) internal successors, (2739), 32 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:29,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 249.0) internal successors, (8217), 33 states have internal predecessors, (8217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:29,204 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 249.0) internal successors, (8217), 33 states have internal predecessors, (8217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:29,204 INFO L175 Difference]: Start difference. First operand has 355 places, 1066 transitions, 19416 flow. Second operand 32 states and 2739 transitions. [2023-01-27 22:47:29,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 1421 transitions, 27186 flow [2023-01-27 22:47:29,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1421 transitions, 24862 flow, removed 1120 selfloop flow, removed 12 redundant places. [2023-01-27 22:47:29,950 INFO L231 Difference]: Finished difference. Result has 378 places, 1285 transitions, 22739 flow [2023-01-27 22:47:29,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=18015, PETRI_DIFFERENCE_MINUEND_PLACES=343, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1065, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=562, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=488, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=22739, PETRI_PLACES=378, PETRI_TRANSITIONS=1285} [2023-01-27 22:47:29,950 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 357 predicate places. [2023-01-27 22:47:29,950 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 1285 transitions, 22739 flow [2023-01-27 22:47:29,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 81.325) internal successors, (3253), 40 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:29,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:29,951 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:29,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:30,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-01-27 22:47:30,156 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:30,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:30,156 INFO L85 PathProgramCache]: Analyzing trace with hash 561847986, now seen corresponding path program 32 times [2023-01-27 22:47:30,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:30,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848246220] [2023-01-27 22:47:30,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:30,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:30,788 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:30,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848246220] [2023-01-27 22:47:30,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848246220] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:30,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061096434] [2023-01-27 22:47:30,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-27 22:47:30,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:30,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:30,789 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:30,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-01-27 22:47:30,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-27 22:47:30,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:30,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 46 conjunts are in the unsatisfiable core [2023-01-27 22:47:30,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:31,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:47:31,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-01-27 22:47:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:31,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:31,478 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:47:31,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 40 [2023-01-27 22:47:31,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-01-27 22:47:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061096434] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:31,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:31,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 40 [2023-01-27 22:47:31,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979894917] [2023-01-27 22:47:31,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:31,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-01-27 22:47:31,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:31,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-01-27 22:47:31,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1366, Unknown=3, NotChecked=0, Total=1640 [2023-01-27 22:47:31,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 249 [2023-01-27 22:47:31,889 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 1285 transitions, 22739 flow. Second operand has 41 states, 41 states have (on average 81.4390243902439) internal successors, (3339), 41 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:31,889 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:31,889 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 249 [2023-01-27 22:47:31,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:39,135 INFO L130 PetriNetUnfolder]: 6814/12507 cut-off events. [2023-01-27 22:47:39,136 INFO L131 PetriNetUnfolder]: For 143125/143132 co-relation queries the response was YES. [2023-01-27 22:47:39,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98538 conditions, 12507 events. 6814/12507 cut-off events. For 143125/143132 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 89929 event pairs, 322 based on Foata normal form. 174/12640 useless extension candidates. Maximal degree in co-relation 98420. Up to 4379 conditions per place. [2023-01-27 22:47:39,329 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 1546 selfloop transitions, 1695 changer transitions 8/3258 dead transitions. [2023-01-27 22:47:39,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 3258 transitions, 58884 flow [2023-01-27 22:47:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-27 22:47:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-01-27 22:47:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 4874 transitions. [2023-01-27 22:47:39,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3434087226097372 [2023-01-27 22:47:39,333 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 4874 transitions. [2023-01-27 22:47:39,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 4874 transitions. [2023-01-27 22:47:39,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:39,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 4874 transitions. [2023-01-27 22:47:39,339 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 85.50877192982456) internal successors, (4874), 57 states have internal predecessors, (4874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:39,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 249.0) internal successors, (14442), 58 states have internal predecessors, (14442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:39,345 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 249.0) internal successors, (14442), 58 states have internal predecessors, (14442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:39,345 INFO L175 Difference]: Start difference. First operand has 378 places, 1285 transitions, 22739 flow. Second operand 57 states and 4874 transitions. [2023-01-27 22:47:39,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 3258 transitions, 58884 flow [2023-01-27 22:47:42,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 3258 transitions, 57553 flow, removed 632 selfloop flow, removed 11 redundant places. [2023-01-27 22:47:42,112 INFO L231 Difference]: Finished difference. Result has 447 places, 2707 transitions, 52779 flow [2023-01-27 22:47:42,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=22184, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=699, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=52779, PETRI_PLACES=447, PETRI_TRANSITIONS=2707} [2023-01-27 22:47:42,120 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 426 predicate places. [2023-01-27 22:47:42,120 INFO L495 AbstractCegarLoop]: Abstraction has has 447 places, 2707 transitions, 52779 flow [2023-01-27 22:47:42,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 81.4390243902439) internal successors, (3339), 41 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:42,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:42,121 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:42,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:42,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-01-27 22:47:42,321 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:42,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:42,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1917251359, now seen corresponding path program 33 times [2023-01-27 22:47:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029318722] [2023-01-27 22:47:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:42,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:43,136 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:43,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029318722] [2023-01-27 22:47:43,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029318722] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:43,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341416139] [2023-01-27 22:47:43,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-27 22:47:43,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:43,138 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:43,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-01-27 22:47:43,491 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-27 22:47:43,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:43,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 19 conjunts are in the unsatisfiable core [2023-01-27 22:47:43,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:43,633 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-01-27 22:47:43,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:47:43,717 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-01-27 22:47:43,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 14 [2023-01-27 22:47:43,733 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-01-27 22:47:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341416139] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:47:43,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:47:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7, 7] total 23 [2023-01-27 22:47:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056231034] [2023-01-27 22:47:43,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:47:43,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-01-27 22:47:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:47:43,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-01-27 22:47:43,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2023-01-27 22:47:43,735 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 249 [2023-01-27 22:47:43,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 2707 transitions, 52779 flow. Second operand has 24 states, 24 states have (on average 85.875) internal successors, (2061), 24 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:43,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:47:43,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 249 [2023-01-27 22:47:43,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:47:52,615 INFO L130 PetriNetUnfolder]: 7260/13182 cut-off events. [2023-01-27 22:47:52,615 INFO L131 PetriNetUnfolder]: For 189067/189074 co-relation queries the response was YES. [2023-01-27 22:47:52,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115316 conditions, 13182 events. 7260/13182 cut-off events. For 189067/189074 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 94864 event pairs, 590 based on Foata normal form. 178/13339 useless extension candidates. Maximal degree in co-relation 115174. Up to 9710 conditions per place. [2023-01-27 22:47:52,762 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 2350 selfloop transitions, 712 changer transitions 3/3074 dead transitions. [2023-01-27 22:47:52,763 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 3074 transitions, 64956 flow [2023-01-27 22:47:52,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-01-27 22:47:52,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2023-01-27 22:47:52,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 3137 transitions. [2023-01-27 22:47:52,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35995410212277684 [2023-01-27 22:47:52,765 INFO L72 ComplementDD]: Start complementDD. Operand 35 states and 3137 transitions. [2023-01-27 22:47:52,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 3137 transitions. [2023-01-27 22:47:52,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-27 22:47:52,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 3137 transitions. [2023-01-27 22:47:52,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 36 states, 35 states have (on average 89.62857142857143) internal successors, (3137), 35 states have internal predecessors, (3137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:52,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 36 states, 36 states have (on average 249.0) internal successors, (8964), 36 states have internal predecessors, (8964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:52,771 INFO L81 ComplementDD]: Finished complementDD. Result has 36 states, 36 states have (on average 249.0) internal successors, (8964), 36 states have internal predecessors, (8964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:52,771 INFO L175 Difference]: Start difference. First operand has 447 places, 2707 transitions, 52779 flow. Second operand 35 states and 3137 transitions. [2023-01-27 22:47:52,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 481 places, 3074 transitions, 64956 flow [2023-01-27 22:47:57,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 3074 transitions, 61994 flow, removed 1464 selfloop flow, removed 9 redundant places. [2023-01-27 22:47:57,556 INFO L231 Difference]: Finished difference. Result has 477 places, 2848 transitions, 55171 flow [2023-01-27 22:47:57,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=49811, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=576, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=55171, PETRI_PLACES=477, PETRI_TRANSITIONS=2848} [2023-01-27 22:47:57,559 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 456 predicate places. [2023-01-27 22:47:57,559 INFO L495 AbstractCegarLoop]: Abstraction has has 477 places, 2848 transitions, 55171 flow [2023-01-27 22:47:57,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 85.875) internal successors, (2061), 24 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:47:57,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-27 22:47:57,559 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-27 22:47:57,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2023-01-27 22:47:57,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-01-27 22:47:57,764 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-01-27 22:47:57,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-27 22:47:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 22236125, now seen corresponding path program 34 times [2023-01-27 22:47:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-27 22:47:57,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091792393] [2023-01-27 22:47:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-27 22:47:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-27 22:47:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-27 22:47:58,853 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:58,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-27 22:47:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091792393] [2023-01-27 22:47:58,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091792393] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-27 22:47:58,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426790815] [2023-01-27 22:47:58,853 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-27 22:47:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-27 22:47:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-27 22:47:58,854 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-27 22:47:58,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-01-27 22:47:58,980 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-27 22:47:58,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-27 22:47:58,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 83 conjunts are in the unsatisfiable core [2023-01-27 22:47:58,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-27 22:47:59,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 22:47:59,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-01-27 22:47:59,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-01-27 22:47:59,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-27 22:47:59,379 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2023-01-27 22:47:59,960 INFO L321 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2023-01-27 22:47:59,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 22 [2023-01-27 22:47:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:47:59,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-27 22:48:08,749 WARN L222 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 69 DAG size of output: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-27 22:48:09,692 INFO L321 Elim1Store]: treesize reduction 32, result has 64.8 percent of original size [2023-01-27 22:48:09,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 459 treesize of output 299 [2023-01-27 22:48:09,701 INFO L167 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:09,702 INFO L172 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 265 [2023-01-27 22:48:09,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:09,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 833 treesize of output 901 [2023-01-27 22:48:09,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:09,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 529 treesize of output 600 [2023-01-27 22:48:10,023 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:10,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 491 treesize of output 468 [2023-01-27 22:48:10,072 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:10,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 439 treesize of output 416 [2023-01-27 22:48:10,243 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:10,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 403 treesize of output 519 [2023-01-27 22:48:10,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-27 22:48:10,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 349 treesize of output 420 [2023-01-27 22:55:44,221 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-27 22:55:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-27 22:55:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1426790815] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-27 22:55:46,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-27 22:55:46,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 45 [2023-01-27 22:55:46,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860551019] [2023-01-27 22:55:46,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-27 22:55:46,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-01-27 22:55:46,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-27 22:55:46,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-01-27 22:55:46,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=1908, Unknown=6, NotChecked=0, Total=2162 [2023-01-27 22:55:46,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 249 [2023-01-27 22:55:46,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 477 places, 2848 transitions, 55171 flow. Second operand has 47 states, 47 states have (on average 67.42553191489361) internal successors, (3169), 47 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-27 22:55:46,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-27 22:55:46,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 249 [2023-01-27 22:55:46,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-27 22:56:01,088 WARN L222 SmtUtils]: Spent 13.54s on a formula simplification. DAG size of input: 149 DAG size of output: 124 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-01-27 22:56:07,987 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-27 22:56:08,005 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 [2023-01-27 22:56:08,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-01-27 22:56:09,205 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-01-27 22:56:09,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-01-27 22:56:09,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-01-27 22:56:09,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-01-27 22:56:09,232 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:236) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:209) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:129) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:125) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-01-27 22:56:09,235 INFO L158 Benchmark]: Toolchain (without parser) took 840691.52ms. Allocated memory was 413.1MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 373.9MB in the beginning and 690.6MB in the end (delta: -316.7MB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-27 22:56:09,235 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 310.4MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-27 22:56:09,235 INFO L158 Benchmark]: CACSL2BoogieTranslator took 182.03ms. Allocated memory is still 413.1MB. Free memory was 373.6MB in the beginning and 362.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-01-27 22:56:09,235 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.32ms. Allocated memory is still 413.1MB. Free memory was 362.2MB in the beginning and 360.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:56:09,235 INFO L158 Benchmark]: Boogie Preprocessor took 18.85ms. Allocated memory is still 413.1MB. Free memory was 360.2MB in the beginning and 358.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-27 22:56:09,235 INFO L158 Benchmark]: RCFGBuilder took 415.16ms. Allocated memory is still 413.1MB. Free memory was 358.4MB in the beginning and 334.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-27 22:56:09,235 INFO L158 Benchmark]: TraceAbstraction took 840048.45ms. Allocated memory was 413.1MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 333.5MB in the beginning and 690.6MB in the end (delta: -357.1MB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-01-27 22:56:09,236 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.12ms. Allocated memory is still 310.4MB. Free memory is still 260.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 182.03ms. Allocated memory is still 413.1MB. Free memory was 373.6MB in the beginning and 362.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 23.32ms. Allocated memory is still 413.1MB. Free memory was 362.2MB in the beginning and 360.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.85ms. Allocated memory is still 413.1MB. Free memory was 360.2MB in the beginning and 358.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 415.16ms. Allocated memory is still 413.1MB. Free memory was 358.4MB in the beginning and 334.0MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 840048.45ms. Allocated memory was 413.1MB in the beginning and 3.2GB in the end (delta: 2.8GB). Free memory was 333.5MB in the beginning and 690.6MB in the end (delta: -357.1MB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 114 PlacesBefore, 21 PlacesAfterwards, 118 TransitionsBefore, 17 TransitionsAfterwards, 538 CoEnabledTransitionPairs, 7 FixpointIterations, 73 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 7 ConcurrentYvCompositions, 8 ChoiceCompositions, 121 TotalNumberOfCompositions, 676 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 567, independent: 542, independent conditional: 0, independent unconditional: 542, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 295, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 567, independent: 257, independent conditional: 0, independent unconditional: 257, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 295, unknown conditional: 0, unknown unconditional: 295] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 16, Positive conditional cache size: 0, Positive unconditional cache size: 16, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown