/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 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 09:43:15,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 09:43:15,862 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 09:43:15,897 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 09:43:15,897 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 09:43:15,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 09:43:15,902 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 09:43:15,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 09:43:15,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 09:43:15,910 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 09:43:15,911 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 09:43:15,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 09:43:15,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 09:43:15,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 09:43:15,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 09:43:15,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 09:43:15,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 09:43:15,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 09:43:15,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 09:43:15,925 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 09:43:15,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 09:43:15,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 09:43:15,927 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 09:43:15,928 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 09:43:15,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 09:43:15,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 09:43:15,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 09:43:15,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 09:43:15,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 09:43:15,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 09:43:15,938 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 09:43:15,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 09:43:15,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 09:43:15,940 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 09:43:15,941 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 09:43:15,941 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 09:43:15,941 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 09:43:15,941 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 09:43:15,942 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 09:43:15,942 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 09:43:15,943 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 09:43:15,943 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-28 09:43:15,969 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 09:43:15,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 09:43:15,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 09:43:15,970 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 09:43:15,971 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 09:43:15,971 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 09:43:15,971 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 09:43:15,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 09:43:15,971 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 09:43:15,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 09:43:15,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 09:43:15,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 09:43:15,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 09:43:15,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 09:43:15,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 09:43:15,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 09:43:15,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 09:43:15,974 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 09:43:15,974 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 09:43:15,974 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 09:43:15,974 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 09:43:15,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 09:43:15,974 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 09:43:15,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 09:43:15,974 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 09:43:16,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 09:43:16,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 09:43:16,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 09:43:16,213 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 09:43:16,214 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 09:43:16,214 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-01-28 09:43:17,349 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 09:43:17,486 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 09:43:17,486 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-1.wvr.c [2023-01-28 09:43:17,491 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab84596b/3b4fc835a4a5441499ce65f78e54d189/FLAGd5e46abb5 [2023-01-28 09:43:17,896 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab84596b/3b4fc835a4a5441499ce65f78e54d189 [2023-01-28 09:43:17,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 09:43:17,901 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 09:43:17,904 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 09:43:17,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 09:43:17,906 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 09:43:17,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:43:17" (1/1) ... [2023-01-28 09:43:17,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7912d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:17, skipping insertion in model container [2023-01-28 09:43:17,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:43:17" (1/1) ... [2023-01-28 09:43:17,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 09:43:17,935 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 09:43:18,051 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/parallel-misc-1.wvr.c[2755,2768] [2023-01-28 09:43:18,059 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 09:43:18,066 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 09:43:18,092 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/parallel-misc-1.wvr.c[2755,2768] [2023-01-28 09:43:18,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 09:43:18,107 INFO L208 MainTranslator]: Completed translation [2023-01-28 09:43:18,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18 WrapperNode [2023-01-28 09:43:18,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 09:43:18,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 09:43:18,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 09:43:18,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 09:43:18,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,123 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,151 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 17, calls inlined = 31, statements flattened = 287 [2023-01-28 09:43:18,151 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 09:43:18,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 09:43:18,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 09:43:18,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 09:43:18,159 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,160 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,177 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 09:43:18,182 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 09:43:18,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 09:43:18,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 09:43:18,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (1/1) ... [2023-01-28 09:43:18,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 09:43:18,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:43:18,233 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-28 09:43:18,235 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-28 09:43:18,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 09:43:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 09:43:18,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 09:43:18,267 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 09:43:18,267 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 09:43:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 09:43:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 09:43:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 09:43:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 09:43:18,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 09:43:18,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 09:43:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 09:43:18,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 09:43:18,271 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 09:43:18,431 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 09:43:18,433 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 09:43:18,807 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 09:43:18,823 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 09:43:18,823 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-01-28 09:43:18,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:43:18 BoogieIcfgContainer [2023-01-28 09:43:18,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 09:43:18,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 09:43:18,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 09:43:18,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 09:43:18,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:43:17" (1/3) ... [2023-01-28 09:43:18,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfdd9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:43:18, skipping insertion in model container [2023-01-28 09:43:18,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:43:18" (2/3) ... [2023-01-28 09:43:18,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfdd9e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:43:18, skipping insertion in model container [2023-01-28 09:43:18,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:43:18" (3/3) ... [2023-01-28 09:43:18,838 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2023-01-28 09:43:18,851 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 09:43:18,852 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 09:43:18,852 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 09:43:18,976 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-01-28 09:43:19,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 346 transitions, 708 flow [2023-01-28 09:43:19,183 INFO L130 PetriNetUnfolder]: 28/344 cut-off events. [2023-01-28 09:43:19,183 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 09:43:19,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 353 conditions, 344 events. 28/344 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 768 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2023-01-28 09:43:19,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 346 transitions, 708 flow [2023-01-28 09:43:19,211 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 336 transitions, 684 flow [2023-01-28 09:43:19,214 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 09:43:19,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 315 places, 336 transitions, 684 flow [2023-01-28 09:43:19,239 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 315 places, 336 transitions, 684 flow [2023-01-28 09:43:19,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 315 places, 336 transitions, 684 flow [2023-01-28 09:43:19,299 INFO L130 PetriNetUnfolder]: 28/336 cut-off events. [2023-01-28 09:43:19,300 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 09:43:19,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 336 events. 28/336 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 761 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 223. Up to 2 conditions per place. [2023-01-28 09:43:19,315 INFO L119 LiptonReduction]: Number of co-enabled transitions 25652 [2023-01-28 09:43:28,575 INFO L134 LiptonReduction]: Checked pairs total: 22140 [2023-01-28 09:43:28,575 INFO L136 LiptonReduction]: Total number of compositions: 413 [2023-01-28 09:43:28,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 09:43:28,590 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;@3fb9d2ae, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 09:43:28,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-01-28 09:43:28,594 INFO L130 PetriNetUnfolder]: 4/16 cut-off events. [2023-01-28 09:43:28,594 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-01-28 09:43:28,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:28,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:28,595 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-28 09:43:28,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:28,599 INFO L85 PathProgramCache]: Analyzing trace with hash 200185486, now seen corresponding path program 1 times [2023-01-28 09:43:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204831309] [2023-01-28 09:43:28,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:28,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:29,387 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-28 09:43:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:29,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204831309] [2023-01-28 09:43:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204831309] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:43:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:43:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 09:43:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212008925] [2023-01-28 09:43:29,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:43:29,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 09:43:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:29,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 09:43:29,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-01-28 09:43:29,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-28 09:43:29,432 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 17 transitions, 46 flow. Second operand has 5 states, 5 states have (on average 294.4) internal successors, (1472), 5 states have internal predecessors, (1472), 0 states have call successors, (0), 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-28 09:43:29,432 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:29,432 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-28 09:43:29,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:29,561 INFO L130 PetriNetUnfolder]: 99/168 cut-off events. [2023-01-28 09:43:29,561 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2023-01-28 09:43:29,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 168 events. 99/168 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 490 event pairs, 15 based on Foata normal form. 1/120 useless extension candidates. Maximal degree in co-relation 294. Up to 91 conditions per place. [2023-01-28 09:43:29,563 INFO L137 encePairwiseOnDemand]: 752/759 looper letters, 32 selfloop transitions, 10 changer transitions 1/43 dead transitions. [2023-01-28 09:43:29,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 43 transitions, 199 flow [2023-01-28 09:43:29,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 09:43:29,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 09:43:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1508 transitions. [2023-01-28 09:43:29,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397364953886693 [2023-01-28 09:43:29,587 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1508 transitions. [2023-01-28 09:43:29,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1508 transitions. [2023-01-28 09:43:29,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:29,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1508 transitions. [2023-01-28 09:43:29,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 301.6) internal successors, (1508), 5 states have internal predecessors, (1508), 0 states have call successors, (0), 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-28 09:43:29,607 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:29,609 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:29,610 INFO L175 Difference]: Start difference. First operand has 20 places, 17 transitions, 46 flow. Second operand 5 states and 1508 transitions. [2023-01-28 09:43:29,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 43 transitions, 199 flow [2023-01-28 09:43:29,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 43 transitions, 181 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-01-28 09:43:29,614 INFO L231 Difference]: Finished difference. Result has 23 places, 25 transitions, 99 flow [2023-01-28 09:43:29,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=23, PETRI_TRANSITIONS=25} [2023-01-28 09:43:29,618 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places. [2023-01-28 09:43:29,619 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 25 transitions, 99 flow [2023-01-28 09:43:29,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 294.4) internal successors, (1472), 5 states have internal predecessors, (1472), 0 states have call successors, (0), 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-28 09:43:29,620 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:29,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:29,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 09:43:29,625 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-28 09:43:29,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:29,626 INFO L85 PathProgramCache]: Analyzing trace with hash -419197718, now seen corresponding path program 1 times [2023-01-28 09:43:29,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:29,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6098361] [2023-01-28 09:43:29,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:29,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:29,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:29,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6098361] [2023-01-28 09:43:29,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6098361] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:43:29,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:43:29,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 09:43:29,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75460813] [2023-01-28 09:43:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:43:29,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 09:43:29,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:29,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 09:43:29,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 09:43:29,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 759 [2023-01-28 09:43:29,790 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 25 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 299.25) internal successors, (1197), 4 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:43:29,790 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:29,790 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 759 [2023-01-28 09:43:29,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:29,879 INFO L130 PetriNetUnfolder]: 109/196 cut-off events. [2023-01-28 09:43:29,880 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-01-28 09:43:29,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 196 events. 109/196 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 634 event pairs, 17 based on Foata normal form. 8/196 useless extension candidates. Maximal degree in co-relation 258. Up to 69 conditions per place. [2023-01-28 09:43:29,881 INFO L137 encePairwiseOnDemand]: 753/759 looper letters, 39 selfloop transitions, 13 changer transitions 2/54 dead transitions. [2023-01-28 09:43:29,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 54 transitions, 307 flow [2023-01-28 09:43:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 09:43:29,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 09:43:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1522 transitions. [2023-01-28 09:43:29,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4010540184453228 [2023-01-28 09:43:29,914 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1522 transitions. [2023-01-28 09:43:29,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1522 transitions. [2023-01-28 09:43:29,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:29,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1522 transitions. [2023-01-28 09:43:29,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 304.4) internal successors, (1522), 5 states have internal predecessors, (1522), 0 states have call successors, (0), 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-28 09:43:29,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:29,925 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:29,925 INFO L175 Difference]: Start difference. First operand has 23 places, 25 transitions, 99 flow. Second operand 5 states and 1522 transitions. [2023-01-28 09:43:29,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 54 transitions, 307 flow [2023-01-28 09:43:29,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 54 transitions, 305 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-01-28 09:43:29,927 INFO L231 Difference]: Finished difference. Result has 30 places, 34 transitions, 205 flow [2023-01-28 09:43:29,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=30, PETRI_TRANSITIONS=34} [2023-01-28 09:43:29,928 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 10 predicate places. [2023-01-28 09:43:29,928 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 34 transitions, 205 flow [2023-01-28 09:43:29,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.25) internal successors, (1197), 4 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:43:29,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:29,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:29,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 09:43:29,930 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-28 09:43:29,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:29,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1716415558, now seen corresponding path program 2 times [2023-01-28 09:43:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:29,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241746457] [2023-01-28 09:43:29,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:29,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:29,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:30,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:30,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:30,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241746457] [2023-01-28 09:43:30,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241746457] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:43:30,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:43:30,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 09:43:30,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888389157] [2023-01-28 09:43:30,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:43:30,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 09:43:30,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:30,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 09:43:30,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 09:43:30,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-28 09:43:30,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 34 transitions, 205 flow. Second operand has 4 states, 4 states have (on average 295.25) internal successors, (1181), 4 states have internal predecessors, (1181), 0 states have call successors, (0), 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-28 09:43:30,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:30,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-28 09:43:30,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:30,147 INFO L130 PetriNetUnfolder]: 169/319 cut-off events. [2023-01-28 09:43:30,147 INFO L131 PetriNetUnfolder]: For 569/569 co-relation queries the response was YES. [2023-01-28 09:43:30,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 319 events. 169/319 cut-off events. For 569/569 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 1234 event pairs, 67 based on Foata normal form. 16/335 useless extension candidates. Maximal degree in co-relation 612. Up to 122 conditions per place. [2023-01-28 09:43:30,149 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 55 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2023-01-28 09:43:30,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 66 transitions, 514 flow [2023-01-28 09:43:30,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 09:43:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 09:43:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1497 transitions. [2023-01-28 09:43:30,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39446640316205533 [2023-01-28 09:43:30,153 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1497 transitions. [2023-01-28 09:43:30,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1497 transitions. [2023-01-28 09:43:30,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:30,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1497 transitions. [2023-01-28 09:43:30,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 299.4) internal successors, (1497), 5 states have internal predecessors, (1497), 0 states have call successors, (0), 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-28 09:43:30,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:30,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:30,165 INFO L175 Difference]: Start difference. First operand has 30 places, 34 transitions, 205 flow. Second operand 5 states and 1497 transitions. [2023-01-28 09:43:30,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 66 transitions, 514 flow [2023-01-28 09:43:30,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 66 transitions, 502 flow, removed 6 selfloop flow, removed 0 redundant places. [2023-01-28 09:43:30,169 INFO L231 Difference]: Finished difference. Result has 37 places, 39 transitions, 278 flow [2023-01-28 09:43:30,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=199, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=37, PETRI_TRANSITIONS=39} [2023-01-28 09:43:30,170 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 17 predicate places. [2023-01-28 09:43:30,170 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 39 transitions, 278 flow [2023-01-28 09:43:30,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 295.25) internal successors, (1181), 4 states have internal predecessors, (1181), 0 states have call successors, (0), 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-28 09:43:30,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:30,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:30,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 09:43:30,171 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-28 09:43:30,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:30,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1708128844, now seen corresponding path program 1 times [2023-01-28 09:43:30,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:30,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387781204] [2023-01-28 09:43:30,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:30,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:30,271 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-28 09:43:30,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:30,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387781204] [2023-01-28 09:43:30,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387781204] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:43:30,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:43:30,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-01-28 09:43:30,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034886421] [2023-01-28 09:43:30,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:43:30,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 09:43:30,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:30,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 09:43:30,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 09:43:30,274 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 759 [2023-01-28 09:43:30,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 39 transitions, 278 flow. Second operand has 4 states, 4 states have (on average 299.5) internal successors, (1198), 4 states have internal predecessors, (1198), 0 states have call successors, (0), 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-28 09:43:30,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:30,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 759 [2023-01-28 09:43:30,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:30,370 INFO L130 PetriNetUnfolder]: 155/293 cut-off events. [2023-01-28 09:43:30,370 INFO L131 PetriNetUnfolder]: For 513/513 co-relation queries the response was YES. [2023-01-28 09:43:30,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 293 events. 155/293 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1124 event pairs, 16 based on Foata normal form. 6/299 useless extension candidates. Maximal degree in co-relation 758. Up to 134 conditions per place. [2023-01-28 09:43:30,372 INFO L137 encePairwiseOnDemand]: 753/759 looper letters, 39 selfloop transitions, 20 changer transitions 6/65 dead transitions. [2023-01-28 09:43:30,372 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 551 flow [2023-01-28 09:43:30,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 09:43:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 09:43:30,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1519 transitions. [2023-01-28 09:43:30,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4002635046113307 [2023-01-28 09:43:30,377 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1519 transitions. [2023-01-28 09:43:30,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1519 transitions. [2023-01-28 09:43:30,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:30,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1519 transitions. [2023-01-28 09:43:30,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 303.8) internal successors, (1519), 5 states have internal predecessors, (1519), 0 states have call successors, (0), 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-28 09:43:30,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:30,388 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:30,388 INFO L175 Difference]: Start difference. First operand has 37 places, 39 transitions, 278 flow. Second operand 5 states and 1519 transitions. [2023-01-28 09:43:30,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 551 flow [2023-01-28 09:43:30,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 541 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-01-28 09:43:30,392 INFO L231 Difference]: Finished difference. Result has 44 places, 45 transitions, 399 flow [2023-01-28 09:43:30,392 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=399, PETRI_PLACES=44, PETRI_TRANSITIONS=45} [2023-01-28 09:43:30,392 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 24 predicate places. [2023-01-28 09:43:30,393 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 45 transitions, 399 flow [2023-01-28 09:43:30,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.5) internal successors, (1198), 4 states have internal predecessors, (1198), 0 states have call successors, (0), 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-28 09:43:30,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:30,394 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:30,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 09:43:30,394 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-28 09:43:30,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:30,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1411080757, now seen corresponding path program 1 times [2023-01-28 09:43:30,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:30,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768560183] [2023-01-28 09:43:30,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:30,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:30,532 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:30,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:30,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768560183] [2023-01-28 09:43:30,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768560183] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 09:43:30,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 09:43:30,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 09:43:30,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741069774] [2023-01-28 09:43:30,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:43:30,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 09:43:30,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:30,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 09:43:30,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 09:43:30,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-28 09:43:30,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 45 transitions, 399 flow. Second operand has 4 states, 4 states have (on average 295.5) internal successors, (1182), 4 states have internal predecessors, (1182), 0 states have call successors, (0), 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-28 09:43:30,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:30,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-28 09:43:30,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:30,638 INFO L130 PetriNetUnfolder]: 94/176 cut-off events. [2023-01-28 09:43:30,639 INFO L131 PetriNetUnfolder]: For 590/590 co-relation queries the response was YES. [2023-01-28 09:43:30,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 845 conditions, 176 events. 94/176 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 536 event pairs, 34 based on Foata normal form. 6/182 useless extension candidates. Maximal degree in co-relation 765. Up to 126 conditions per place. [2023-01-28 09:43:30,640 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 40 selfloop transitions, 4 changer transitions 10/54 dead transitions. [2023-01-28 09:43:30,640 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 54 transitions, 510 flow [2023-01-28 09:43:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 09:43:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 09:43:30,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1493 transitions. [2023-01-28 09:43:30,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39341238471673257 [2023-01-28 09:43:30,645 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1493 transitions. [2023-01-28 09:43:30,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1493 transitions. [2023-01-28 09:43:30,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:30,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1493 transitions. [2023-01-28 09:43:30,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 298.6) internal successors, (1493), 5 states have internal predecessors, (1493), 0 states have call successors, (0), 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-28 09:43:30,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:30,655 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:30,655 INFO L175 Difference]: Start difference. First operand has 44 places, 45 transitions, 399 flow. Second operand 5 states and 1493 transitions. [2023-01-28 09:43:30,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 54 transitions, 510 flow [2023-01-28 09:43:30,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 500 flow, removed 5 selfloop flow, removed 0 redundant places. [2023-01-28 09:43:30,659 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 328 flow [2023-01-28 09:43:30,659 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=328, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-01-28 09:43:30,660 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 29 predicate places. [2023-01-28 09:43:30,660 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 328 flow [2023-01-28 09:43:30,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 295.5) internal successors, (1182), 4 states have internal predecessors, (1182), 0 states have call successors, (0), 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-28 09:43:30,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:30,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:30,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-01-28 09:43:30,661 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-28 09:43:30,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:30,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1125366281, now seen corresponding path program 1 times [2023-01-28 09:43:30,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:30,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643690647] [2023-01-28 09:43:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:30,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:30,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:30,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643690647] [2023-01-28 09:43:30,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643690647] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:43:30,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371763621] [2023-01-28 09:43:30,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:30,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:30,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:43:30,798 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-28 09:43:30,811 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-28 09:43:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:30,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 10 conjunts are in the unsatisfiable core [2023-01-28 09:43:30,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:43:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:31,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:43:31,131 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-28 09:43:31,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371763621] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 09:43:31,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 09:43:31,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 7 [2023-01-28 09:43:31,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744732906] [2023-01-28 09:43:31,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 09:43:31,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-01-28 09:43:31,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:31,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-01-28 09:43:31,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-01-28 09:43:31,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 759 [2023-01-28 09:43:31,135 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 328 flow. Second operand has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:43:31,135 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:31,135 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 759 [2023-01-28 09:43:31,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:31,198 INFO L130 PetriNetUnfolder]: 100/169 cut-off events. [2023-01-28 09:43:31,198 INFO L131 PetriNetUnfolder]: For 617/617 co-relation queries the response was YES. [2023-01-28 09:43:31,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 169 events. 100/169 cut-off events. For 617/617 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 440 event pairs, 18 based on Foata normal form. 16/185 useless extension candidates. Maximal degree in co-relation 767. Up to 111 conditions per place. [2023-01-28 09:43:31,200 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 40 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-01-28 09:43:31,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 458 flow [2023-01-28 09:43:31,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 09:43:31,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 09:43:31,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1485 transitions. [2023-01-28 09:43:31,204 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.391304347826087 [2023-01-28 09:43:31,204 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1485 transitions. [2023-01-28 09:43:31,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1485 transitions. [2023-01-28 09:43:31,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:31,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1485 transitions. [2023-01-28 09:43:31,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 297.0) internal successors, (1485), 5 states have internal predecessors, (1485), 0 states have call successors, (0), 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-28 09:43:31,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:31,212 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 759.0) internal successors, (4554), 6 states have internal predecessors, (4554), 0 states have call successors, (0), 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-28 09:43:31,212 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 328 flow. Second operand 5 states and 1485 transitions. [2023-01-28 09:43:31,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 458 flow [2023-01-28 09:43:31,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 47 transitions, 410 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-01-28 09:43:31,215 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 303 flow [2023-01-28 09:43:31,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-01-28 09:43:31,216 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 25 predicate places. [2023-01-28 09:43:31,216 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 303 flow [2023-01-28 09:43:31,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 295.0) internal successors, (1475), 5 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:43:31,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:31,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:31,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-01-28 09:43:31,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-01-28 09:43:31,424 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-28 09:43:31,424 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:31,424 INFO L85 PathProgramCache]: Analyzing trace with hash -4780107, now seen corresponding path program 1 times [2023-01-28 09:43:31,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:31,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655755688] [2023-01-28 09:43:31,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:31,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:33,696 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:33,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655755688] [2023-01-28 09:43:33,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655755688] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:43:33,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108590996] [2023-01-28 09:43:33,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:33,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:43:33,703 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-28 09:43:33,704 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-28 09:43:33,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:33,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 09:43:33,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:43:34,294 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 143 treesize of output 107 [2023-01-28 09:43:34,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:34,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:43:35,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:43:35,462 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 253 treesize of output 221 [2023-01-28 09:43:35,713 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:35,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108590996] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:43:35,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:43:35,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 19 [2023-01-28 09:43:35,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415226026] [2023-01-28 09:43:35,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:43:35,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-01-28 09:43:35,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:35,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-01-28 09:43:35,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2023-01-28 09:43:35,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-28 09:43:35,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 303 flow. Second operand has 20 states, 20 states have (on average 245.25) internal successors, (4905), 20 states have internal predecessors, (4905), 0 states have call successors, (0), 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-28 09:43:35,723 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:35,723 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-28 09:43:35,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:36,894 INFO L130 PetriNetUnfolder]: 272/472 cut-off events. [2023-01-28 09:43:36,894 INFO L131 PetriNetUnfolder]: For 1192/1192 co-relation queries the response was YES. [2023-01-28 09:43:36,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2230 conditions, 472 events. 272/472 cut-off events. For 1192/1192 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1811 event pairs, 6 based on Foata normal form. 3/475 useless extension candidates. Maximal degree in co-relation 1728. Up to 181 conditions per place. [2023-01-28 09:43:36,898 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 104 selfloop transitions, 55 changer transitions 7/166 dead transitions. [2023-01-28 09:43:36,898 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 166 transitions, 1411 flow [2023-01-28 09:43:36,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-01-28 09:43:36,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-01-28 09:43:36,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4743 transitions. [2023-01-28 09:43:36,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3288953609319742 [2023-01-28 09:43:36,910 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4743 transitions. [2023-01-28 09:43:36,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4743 transitions. [2023-01-28 09:43:36,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:36,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4743 transitions. [2023-01-28 09:43:36,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 249.6315789473684) internal successors, (4743), 19 states have internal predecessors, (4743), 0 states have call successors, (0), 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-28 09:43:36,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 759.0) internal successors, (15180), 20 states have internal predecessors, (15180), 0 states have call successors, (0), 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-28 09:43:36,940 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 759.0) internal successors, (15180), 20 states have internal predecessors, (15180), 0 states have call successors, (0), 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-28 09:43:36,941 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 303 flow. Second operand 19 states and 4743 transitions. [2023-01-28 09:43:36,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 166 transitions, 1411 flow [2023-01-28 09:43:36,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 166 transitions, 1408 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-01-28 09:43:36,947 INFO L231 Difference]: Finished difference. Result has 71 places, 87 transitions, 943 flow [2023-01-28 09:43:36,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=943, PETRI_PLACES=71, PETRI_TRANSITIONS=87} [2023-01-28 09:43:36,948 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 51 predicate places. [2023-01-28 09:43:36,948 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 87 transitions, 943 flow [2023-01-28 09:43:36,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 245.25) internal successors, (4905), 20 states have internal predecessors, (4905), 0 states have call successors, (0), 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-28 09:43:36,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:36,950 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:36,956 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-28 09:43:37,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-01-28 09:43:37,157 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-28 09:43:37,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:37,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1877271009, now seen corresponding path program 2 times [2023-01-28 09:43:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859895411] [2023-01-28 09:43:37,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:37,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:38,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859895411] [2023-01-28 09:43:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859895411] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:43:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544386023] [2023-01-28 09:43:38,791 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 09:43:38,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:38,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:43:38,792 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-28 09:43:38,821 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-28 09:43:38,898 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:43:38,899 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:43:38,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-28 09:43:38,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:43:39,300 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 137 treesize of output 101 [2023-01-28 09:43:39,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:39,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:43:40,341 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:43:40,342 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 253 treesize of output 221 [2023-01-28 09:43:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:40,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544386023] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:43:40,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:43:40,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-01-28 09:43:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358971110] [2023-01-28 09:43:40,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:43:40,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 09:43:40,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:40,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 09:43:40,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-01-28 09:43:40,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 759 [2023-01-28 09:43:40,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 87 transitions, 943 flow. Second operand has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 0 states have call successors, (0), 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-28 09:43:40,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:40,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 759 [2023-01-28 09:43:40,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:43,257 INFO L130 PetriNetUnfolder]: 647/1126 cut-off events. [2023-01-28 09:43:43,257 INFO L131 PetriNetUnfolder]: For 7759/7759 co-relation queries the response was YES. [2023-01-28 09:43:43,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6907 conditions, 1126 events. 647/1126 cut-off events. For 7759/7759 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5655 event pairs, 14 based on Foata normal form. 24/1150 useless extension candidates. Maximal degree in co-relation 5613. Up to 387 conditions per place. [2023-01-28 09:43:43,268 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 172 selfloop transitions, 212 changer transitions 17/401 dead transitions. [2023-01-28 09:43:43,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 401 transitions, 4549 flow [2023-01-28 09:43:43,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-01-28 09:43:43,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-01-28 09:43:43,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 11788 transitions. [2023-01-28 09:43:43,296 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3376296041702469 [2023-01-28 09:43:43,297 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 11788 transitions. [2023-01-28 09:43:43,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 11788 transitions. [2023-01-28 09:43:43,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:43,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 11788 transitions. [2023-01-28 09:43:43,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 256.2608695652174) internal successors, (11788), 46 states have internal predecessors, (11788), 0 states have call successors, (0), 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-28 09:43:43,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 759.0) internal successors, (35673), 47 states have internal predecessors, (35673), 0 states have call successors, (0), 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-28 09:43:43,404 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 759.0) internal successors, (35673), 47 states have internal predecessors, (35673), 0 states have call successors, (0), 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-28 09:43:43,405 INFO L175 Difference]: Start difference. First operand has 71 places, 87 transitions, 943 flow. Second operand 46 states and 11788 transitions. [2023-01-28 09:43:43,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 401 transitions, 4549 flow [2023-01-28 09:43:43,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 401 transitions, 4260 flow, removed 139 selfloop flow, removed 3 redundant places. [2023-01-28 09:43:43,447 INFO L231 Difference]: Finished difference. Result has 125 places, 253 transitions, 3493 flow [2023-01-28 09:43:43,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=842, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3493, PETRI_PLACES=125, PETRI_TRANSITIONS=253} [2023-01-28 09:43:43,449 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2023-01-28 09:43:43,449 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 253 transitions, 3493 flow [2023-01-28 09:43:43,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 0 states have call successors, (0), 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-28 09:43:43,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:43,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:43,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-01-28 09:43:43,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:43,657 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-28 09:43:43,658 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:43,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1904976639, now seen corresponding path program 3 times [2023-01-28 09:43:43,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:43,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498121941] [2023-01-28 09:43:43,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:43,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:43,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:45,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:45,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498121941] [2023-01-28 09:43:45,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498121941] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:43:45,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088427047] [2023-01-28 09:43:45,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 09:43:45,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:45,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:43:45,240 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-28 09:43:45,241 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-28 09:43:45,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 09:43:45,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:43:45,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 59 conjunts are in the unsatisfiable core [2023-01-28 09:43:45,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:43:45,385 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-28 09:43:45,460 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-28 09:43:45,508 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-28 09:43:45,817 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 143 treesize of output 107 [2023-01-28 09:43:45,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:45,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:43:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088427047] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:43:47,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:43:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2023-01-28 09:43:47,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902577250] [2023-01-28 09:43:47,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:43:47,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 09:43:47,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:47,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 09:43:47,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=328, Unknown=2, NotChecked=0, Total=420 [2023-01-28 09:43:47,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-28 09:43:47,118 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 253 transitions, 3493 flow. Second operand has 21 states, 21 states have (on average 245.0) internal successors, (5145), 21 states have internal predecessors, (5145), 0 states have call successors, (0), 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-28 09:43:47,118 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:47,118 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-28 09:43:47,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:43:53,504 WARN L222 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 84 DAG size of output: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:43:53,704 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base)) (.cse15 (+ c_~A~0.offset (* c_~j~0 4)))) (let ((.cse24 (select .cse8 .cse15)) (.cse23 (+ c_~bag1~0 c_~sum1~0))) (let ((.cse2 (< 2147483647 .cse23)) (.cse3 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse9 (+ c_~A~0.offset (* c_~i~0 4))) (.cse0 (< (+ c_~bag2~0 .cse24 2147483648) 0)) (.cse1 (< 2147483647 (+ c_~bag2~0 .cse24))) (.cse10 (<= c_~N~0 c_~j~0)) (.cse6 (+ c_~bag2~0 .cse24 c_~sum2~0)) (.cse11 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (or .cse0 .cse1 (let ((.cse5 (select .cse8 .cse9))) (let ((.cse4 (let ((.cse7 (+ c_~bag1~0 c_~sum1~0 .cse5))) (and (<= .cse6 .cse7) (<= .cse7 .cse6))))) (and (or .cse2 .cse3 .cse4) (or (< 2147483647 (+ c_~bag1~0 .cse5)) .cse4 (< (+ c_~bag1~0 .cse5 2147483648) 0))))) .cse10) (<= .cse11 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= c_~N~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~sum1~0 2147483647) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum1~0 2147483648)) (or (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse13 (select .cse14 .cse15)) (.cse12 (select .cse14 .cse9))) (or (< (+ c_~bag1~0 .cse12 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13)) (<= (+ c_~bag1~0 c_~sum1~0 .cse12) (+ c_~bag2~0 c_~sum2~0 .cse13)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse12)))))) (or (and (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse16 (select .cse17 .cse15))) (or (< 2147483647 (+ c_~bag2~0 .cse16)) (<= (+ c_~bag2~0 c_~sum2~0 .cse16) (+ c_~bag1~0 c_~sum1~0 (select .cse17 .cse9))) (< (+ c_~bag2~0 .cse16 2147483648) 0))))) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse15))) (or (< 2147483647 (+ c_~bag2~0 .cse18)) (<= (+ c_~bag1~0 c_~sum1~0 (select .cse19 .cse9)) (+ c_~bag2~0 c_~sum2~0 .cse18)) (< (+ c_~bag2~0 .cse18 2147483648) 0)))))) .cse2 .cse3) (forall ((v_ArrVal_191 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_191) c_~A~0.base))) (let ((.cse21 (select .cse22 .cse15)) (.cse20 (select .cse22 .cse9))) (or (< (+ c_~bag1~0 .cse20 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse21)) (<= (+ c_~bag2~0 c_~sum2~0 .cse21) (+ c_~bag1~0 c_~sum1~0 .cse20)) (< (+ c_~bag2~0 .cse21 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse20))))))) .cse10) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (or .cse0 .cse1 .cse10 (and (<= .cse6 .cse23) (<= .cse23 .cse6))) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (<= .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base|))))) is different from false [2023-01-28 09:43:55,465 INFO L130 PetriNetUnfolder]: 824/1490 cut-off events. [2023-01-28 09:43:55,466 INFO L131 PetriNetUnfolder]: For 14285/14285 co-relation queries the response was YES. [2023-01-28 09:43:55,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10338 conditions, 1490 events. 824/1490 cut-off events. For 14285/14285 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 8246 event pairs, 33 based on Foata normal form. 4/1494 useless extension candidates. Maximal degree in co-relation 9552. Up to 506 conditions per place. [2023-01-28 09:43:55,484 INFO L137 encePairwiseOnDemand]: 745/759 looper letters, 223 selfloop transitions, 186 changer transitions 11/420 dead transitions. [2023-01-28 09:43:55,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 420 transitions, 6158 flow [2023-01-28 09:43:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-01-28 09:43:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-01-28 09:43:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 6984 transitions. [2023-01-28 09:43:55,495 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3286278938452851 [2023-01-28 09:43:55,495 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 6984 transitions. [2023-01-28 09:43:55,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 6984 transitions. [2023-01-28 09:43:55,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:43:55,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 6984 transitions. [2023-01-28 09:43:55,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 249.42857142857142) internal successors, (6984), 28 states have internal predecessors, (6984), 0 states have call successors, (0), 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-28 09:43:55,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 759.0) internal successors, (22011), 29 states have internal predecessors, (22011), 0 states have call successors, (0), 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-28 09:43:55,529 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 759.0) internal successors, (22011), 29 states have internal predecessors, (22011), 0 states have call successors, (0), 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-28 09:43:55,529 INFO L175 Difference]: Start difference. First operand has 125 places, 253 transitions, 3493 flow. Second operand 28 states and 6984 transitions. [2023-01-28 09:43:55,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 420 transitions, 6158 flow [2023-01-28 09:43:55,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 420 transitions, 4895 flow, removed 595 selfloop flow, removed 9 redundant places. [2023-01-28 09:43:55,637 INFO L231 Difference]: Finished difference. Result has 158 places, 321 transitions, 4060 flow [2023-01-28 09:43:55,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2674, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4060, PETRI_PLACES=158, PETRI_TRANSITIONS=321} [2023-01-28 09:43:55,638 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 138 predicate places. [2023-01-28 09:43:55,638 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 321 transitions, 4060 flow [2023-01-28 09:43:55,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 245.0) internal successors, (5145), 21 states have internal predecessors, (5145), 0 states have call successors, (0), 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-28 09:43:55,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:43:55,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:43:55,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 09:43:55,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:55,846 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-28 09:43:55,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:43:55,846 INFO L85 PathProgramCache]: Analyzing trace with hash -927665921, now seen corresponding path program 4 times [2023-01-28 09:43:55,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:43:55,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098553602] [2023-01-28 09:43:55,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:43:55,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:43:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:43:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:43:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098553602] [2023-01-28 09:43:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098553602] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:43:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168329449] [2023-01-28 09:43:57,201 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 09:43:57,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:43:57,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:43:57,203 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-28 09:43:57,205 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-28 09:43:57,300 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 09:43:57,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:43:57,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 54 conjunts are in the unsatisfiable core [2023-01-28 09:43:57,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:43:57,689 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 137 treesize of output 101 [2023-01-28 09:43:57,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:43:57,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:43:58,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:43:58,535 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 253 treesize of output 221 [2023-01-28 09:43:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:43:58,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168329449] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:43:58,924 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:43:58,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 22 [2023-01-28 09:43:58,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333409644] [2023-01-28 09:43:58,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:43:58,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 09:43:58,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:43:58,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 09:43:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2023-01-28 09:43:58,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-28 09:43:58,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 321 transitions, 4060 flow. Second operand has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 0 states have call successors, (0), 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-28 09:43:58,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:43:58,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-28 09:43:58,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:44:02,185 INFO L130 PetriNetUnfolder]: 765/1390 cut-off events. [2023-01-28 09:44:02,186 INFO L131 PetriNetUnfolder]: For 9688/9688 co-relation queries the response was YES. [2023-01-28 09:44:02,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8966 conditions, 1390 events. 765/1390 cut-off events. For 9688/9688 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 7367 event pairs, 9 based on Foata normal form. 14/1404 useless extension candidates. Maximal degree in co-relation 8833. Up to 368 conditions per place. [2023-01-28 09:44:02,202 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 139 selfloop transitions, 322 changer transitions 16/477 dead transitions. [2023-01-28 09:44:02,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 477 transitions, 6110 flow [2023-01-28 09:44:02,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-01-28 09:44:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-01-28 09:44:02,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 12167 transitions. [2023-01-28 09:44:02,218 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3271490414347557 [2023-01-28 09:44:02,219 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 12167 transitions. [2023-01-28 09:44:02,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 12167 transitions. [2023-01-28 09:44:02,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:44:02,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 12167 transitions. [2023-01-28 09:44:02,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 248.30612244897958) internal successors, (12167), 49 states have internal predecessors, (12167), 0 states have call successors, (0), 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-28 09:44:02,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 759.0) internal successors, (37950), 50 states have internal predecessors, (37950), 0 states have call successors, (0), 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-28 09:44:02,321 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 759.0) internal successors, (37950), 50 states have internal predecessors, (37950), 0 states have call successors, (0), 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-28 09:44:02,321 INFO L175 Difference]: Start difference. First operand has 158 places, 321 transitions, 4060 flow. Second operand 49 states and 12167 transitions. [2023-01-28 09:44:02,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 477 transitions, 6110 flow [2023-01-28 09:44:02,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 477 transitions, 5786 flow, removed 82 selfloop flow, removed 21 redundant places. [2023-01-28 09:44:02,386 INFO L231 Difference]: Finished difference. Result has 181 places, 360 transitions, 5031 flow [2023-01-28 09:44:02,387 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2641, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=203, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5031, PETRI_PLACES=181, PETRI_TRANSITIONS=360} [2023-01-28 09:44:02,388 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 161 predicate places. [2023-01-28 09:44:02,388 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 360 transitions, 5031 flow [2023-01-28 09:44:02,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 0 states have call successors, (0), 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-28 09:44:02,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:44:02,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:44:02,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 09:44:02,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-01-28 09:44:02,595 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-28 09:44:02,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:44:02,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1874892425, now seen corresponding path program 5 times [2023-01-28 09:44:02,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:44:02,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403195044] [2023-01-28 09:44:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:44:02,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:44:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:44:03,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:03,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:44:03,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403195044] [2023-01-28 09:44:03,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403195044] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:44:03,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555584836] [2023-01-28 09:44:03,913 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 09:44:03,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:03,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:44:03,916 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-28 09:44:03,918 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-28 09:44:04,007 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 09:44:04,008 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:44:04,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 53 conjunts are in the unsatisfiable core [2023-01-28 09:44:04,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:44:04,434 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 123 treesize of output 103 [2023-01-28 09:44:04,495 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:04,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:44:05,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:44:05,002 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 339 treesize of output 251 [2023-01-28 09:44:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:44:05,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555584836] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:44:05,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:44:05,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-01-28 09:44:05,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915443980] [2023-01-28 09:44:05,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:44:05,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-01-28 09:44:05,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:44:05,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-01-28 09:44:05,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-01-28 09:44:05,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 759 [2023-01-28 09:44:05,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 360 transitions, 5031 flow. Second operand has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 0 states have call successors, (0), 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-28 09:44:05,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:44:05,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 759 [2023-01-28 09:44:05,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:44:06,872 INFO L130 PetriNetUnfolder]: 747/1400 cut-off events. [2023-01-28 09:44:06,872 INFO L131 PetriNetUnfolder]: For 9064/9064 co-relation queries the response was YES. [2023-01-28 09:44:06,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9668 conditions, 1400 events. 747/1400 cut-off events. For 9064/9064 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 7661 event pairs, 10 based on Foata normal form. 12/1412 useless extension candidates. Maximal degree in co-relation 9549. Up to 377 conditions per place. [2023-01-28 09:44:06,889 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 174 selfloop transitions, 255 changer transitions 12/441 dead transitions. [2023-01-28 09:44:06,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 441 transitions, 6447 flow [2023-01-28 09:44:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-01-28 09:44:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-01-28 09:44:06,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 6912 transitions. [2023-01-28 09:44:06,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3372859025032938 [2023-01-28 09:44:06,899 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 6912 transitions. [2023-01-28 09:44:06,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 6912 transitions. [2023-01-28 09:44:06,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:44:06,901 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 6912 transitions. [2023-01-28 09:44:06,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 256.0) internal successors, (6912), 27 states have internal predecessors, (6912), 0 states have call successors, (0), 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-28 09:44:06,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 759.0) internal successors, (21252), 28 states have internal predecessors, (21252), 0 states have call successors, (0), 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-28 09:44:06,925 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 759.0) internal successors, (21252), 28 states have internal predecessors, (21252), 0 states have call successors, (0), 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-28 09:44:06,925 INFO L175 Difference]: Start difference. First operand has 181 places, 360 transitions, 5031 flow. Second operand 27 states and 6912 transitions. [2023-01-28 09:44:06,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 441 transitions, 6447 flow [2023-01-28 09:44:07,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 441 transitions, 5743 flow, removed 260 selfloop flow, removed 28 redundant places. [2023-01-28 09:44:07,025 INFO L231 Difference]: Finished difference. Result has 183 places, 368 transitions, 5243 flow [2023-01-28 09:44:07,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4089, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=5243, PETRI_PLACES=183, PETRI_TRANSITIONS=368} [2023-01-28 09:44:07,026 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 163 predicate places. [2023-01-28 09:44:07,026 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 368 transitions, 5243 flow [2023-01-28 09:44:07,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 252.04761904761904) internal successors, (5293), 21 states have internal predecessors, (5293), 0 states have call successors, (0), 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-28 09:44:07,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:44:07,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:44:07,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-01-28 09:44:07,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:07,233 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-28 09:44:07,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:44:07,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1562389633, now seen corresponding path program 6 times [2023-01-28 09:44:07,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:44:07,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826026936] [2023-01-28 09:44:07,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:44:07,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:44:07,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:44:08,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:08,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:44:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826026936] [2023-01-28 09:44:08,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826026936] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:44:08,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627268726] [2023-01-28 09:44:08,538 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 09:44:08,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:08,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:44:08,540 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-28 09:44:08,542 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-28 09:44:08,721 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 09:44:08,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:44:08,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 66 conjunts are in the unsatisfiable core [2023-01-28 09:44:08,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:44:08,771 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-28 09:44:08,849 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-28 09:44:08,925 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-28 09:44:09,259 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 123 treesize of output 103 [2023-01-28 09:44:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:09,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:44:10,393 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse0 (<= (+ 2 c_~i~0) c_~N~0)) (.cse4 (+ c_~A~0.offset (* c_~j~0 4))) (.cse3 (+ c_~A~0.offset (* c_~i~0 4)))) (and (or (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) .cse0 (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base))) (let ((.cse1 (select .cse2 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse1)) (< (+ c_~bag2~0 .cse1 2147483648) 0) (= (+ (select .cse2 .cse3) c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse1 c_~sum2~0)))))) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (or .cse0 (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_285) c_~A~0.base))) (let ((.cse5 (select .cse7 .cse3)) (.cse6 (select .cse7 .cse4))) (or (< 2147483647 (+ .cse5 c_~bag1~0)) (< (+ .cse5 c_~bag1~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse6)) (< (+ c_~bag2~0 .cse6 2147483648) 0) (= (+ .cse5 c_~bag1~0 c_~sum1~0) (+ c_~bag2~0 .cse6 c_~sum2~0))))))))) (<= c_~N~0 c_~j~0)) is different from false [2023-01-28 09:44:10,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:44:10,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627268726] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:44:10,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:44:10,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 22 [2023-01-28 09:44:10,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817287699] [2023-01-28 09:44:10,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:44:10,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-01-28 09:44:10,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:44:10,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-01-28 09:44:10,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=383, Unknown=1, NotChecked=40, Total=506 [2023-01-28 09:44:10,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-28 09:44:10,480 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 368 transitions, 5243 flow. Second operand has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 0 states have call successors, (0), 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-28 09:44:10,480 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:44:10,480 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-28 09:44:10,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:44:14,252 INFO L130 PetriNetUnfolder]: 709/1330 cut-off events. [2023-01-28 09:44:14,252 INFO L131 PetriNetUnfolder]: For 6999/6999 co-relation queries the response was YES. [2023-01-28 09:44:14,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9045 conditions, 1330 events. 709/1330 cut-off events. For 6999/6999 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 7208 event pairs, 23 based on Foata normal form. 6/1336 useless extension candidates. Maximal degree in co-relation 8878. Up to 477 conditions per place. [2023-01-28 09:44:14,267 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 142 selfloop transitions, 260 changer transitions 11/413 dead transitions. [2023-01-28 09:44:14,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 413 transitions, 6116 flow [2023-01-28 09:44:14,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-01-28 09:44:14,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-01-28 09:44:14,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 6456 transitions. [2023-01-28 09:44:14,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32715110975980544 [2023-01-28 09:44:14,283 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 6456 transitions. [2023-01-28 09:44:14,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 6456 transitions. [2023-01-28 09:44:14,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:44:14,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 6456 transitions. [2023-01-28 09:44:14,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 248.30769230769232) internal successors, (6456), 26 states have internal predecessors, (6456), 0 states have call successors, (0), 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-28 09:44:14,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 759.0) internal successors, (20493), 27 states have internal predecessors, (20493), 0 states have call successors, (0), 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-28 09:44:14,309 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 759.0) internal successors, (20493), 27 states have internal predecessors, (20493), 0 states have call successors, (0), 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-28 09:44:14,309 INFO L175 Difference]: Start difference. First operand has 183 places, 368 transitions, 5243 flow. Second operand 26 states and 6456 transitions. [2023-01-28 09:44:14,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 413 transitions, 6116 flow [2023-01-28 09:44:14,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 413 transitions, 5954 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-01-28 09:44:14,377 INFO L231 Difference]: Finished difference. Result has 197 places, 360 transitions, 5485 flow [2023-01-28 09:44:14,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4637, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=239, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5485, PETRI_PLACES=197, PETRI_TRANSITIONS=360} [2023-01-28 09:44:14,379 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 177 predicate places. [2023-01-28 09:44:14,379 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 360 transitions, 5485 flow [2023-01-28 09:44:14,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 244.8695652173913) internal successors, (5632), 23 states have internal predecessors, (5632), 0 states have call successors, (0), 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-28 09:44:14,380 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:44:14,380 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:44:14,387 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-28 09:44:14,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:14,585 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-28 09:44:14,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:44:14,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1901055643, now seen corresponding path program 7 times [2023-01-28 09:44:14,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:44:14,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251409905] [2023-01-28 09:44:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:44:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:44:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:44:15,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:15,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:44:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251409905] [2023-01-28 09:44:15,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251409905] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:44:15,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995661308] [2023-01-28 09:44:15,589 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 09:44:15,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:15,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:44:15,590 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-28 09:44:15,593 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-28 09:44:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:44:15,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 42 conjunts are in the unsatisfiable core [2023-01-28 09:44:15,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:44:15,976 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 123 treesize of output 103 [2023-01-28 09:44:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:44:16,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:44:16,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:44:16,661 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 339 treesize of output 251 [2023-01-28 09:44:16,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:44:16,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995661308] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:44:16,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:44:16,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 6] total 18 [2023-01-28 09:44:16,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530804300] [2023-01-28 09:44:16,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:44:16,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-01-28 09:44:16,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:44:16,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-01-28 09:44:16,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2023-01-28 09:44:16,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-28 09:44:16,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 360 transitions, 5485 flow. Second operand has 19 states, 19 states have (on average 245.21052631578948) internal successors, (4659), 19 states have internal predecessors, (4659), 0 states have call successors, (0), 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-28 09:44:16,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:44:16,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-28 09:44:16,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:44:17,696 INFO L130 PetriNetUnfolder]: 712/1329 cut-off events. [2023-01-28 09:44:17,696 INFO L131 PetriNetUnfolder]: For 7286/7286 co-relation queries the response was YES. [2023-01-28 09:44:17,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9672 conditions, 1329 events. 712/1329 cut-off events. For 7286/7286 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 7191 event pairs, 41 based on Foata normal form. 2/1331 useless extension candidates. Maximal degree in co-relation 9549. Up to 778 conditions per place. [2023-01-28 09:44:17,708 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 302 selfloop transitions, 87 changer transitions 8/397 dead transitions. [2023-01-28 09:44:17,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 397 transitions, 6460 flow [2023-01-28 09:44:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 09:44:17,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 09:44:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4237 transitions. [2023-01-28 09:44:17,714 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3283732465318143 [2023-01-28 09:44:17,714 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4237 transitions. [2023-01-28 09:44:17,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4237 transitions. [2023-01-28 09:44:17,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:44:17,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4237 transitions. [2023-01-28 09:44:17,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 249.23529411764707) internal successors, (4237), 17 states have internal predecessors, (4237), 0 states have call successors, (0), 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-28 09:44:17,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 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-28 09:44:17,727 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 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-28 09:44:17,727 INFO L175 Difference]: Start difference. First operand has 197 places, 360 transitions, 5485 flow. Second operand 17 states and 4237 transitions. [2023-01-28 09:44:17,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 397 transitions, 6460 flow [2023-01-28 09:44:17,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 397 transitions, 6393 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-01-28 09:44:17,801 INFO L231 Difference]: Finished difference. Result has 205 places, 360 transitions, 5641 flow [2023-01-28 09:44:17,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5422, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5641, PETRI_PLACES=205, PETRI_TRANSITIONS=360} [2023-01-28 09:44:17,802 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 185 predicate places. [2023-01-28 09:44:17,802 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 360 transitions, 5641 flow [2023-01-28 09:44:17,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 245.21052631578948) internal successors, (4659), 19 states have internal predecessors, (4659), 0 states have call successors, (0), 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-28 09:44:17,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:44:17,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:44:17,809 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-28 09:44:18,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-01-28 09:44:18,009 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-28 09:44:18,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:44:18,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1100080267, now seen corresponding path program 8 times [2023-01-28 09:44:18,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:44:18,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487007484] [2023-01-28 09:44:18,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:44:18,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:44:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:44:18,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:18,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:44:18,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487007484] [2023-01-28 09:44:18,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487007484] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:44:18,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186450274] [2023-01-28 09:44:18,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 09:44:18,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:18,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:44:18,953 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-28 09:44:18,955 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-28 09:44:19,044 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:44:19,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:44:19,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 57 conjunts are in the unsatisfiable core [2023-01-28 09:44:19,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:44:19,082 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-28 09:44:19,132 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-28 09:44:19,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:44:19,287 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 14 treesize of output 16 [2023-01-28 09:44:19,406 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 137 treesize of output 101 [2023-01-28 09:44:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:19,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:44:20,514 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:44:20,514 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 1 case distinctions, treesize of input 97 treesize of output 61 [2023-01-28 09:44:20,519 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 228 treesize of output 204 [2023-01-28 09:44:20,528 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 69 treesize of output 63 [2023-01-28 09:44:20,540 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 128 treesize of output 116 [2023-01-28 09:44:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186450274] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:44:20,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:44:20,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23 [2023-01-28 09:44:20,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197559362] [2023-01-28 09:44:20,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:44:20,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-01-28 09:44:20,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:44:20,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-01-28 09:44:20,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=506, Unknown=2, NotChecked=0, Total=600 [2023-01-28 09:44:20,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 759 [2023-01-28 09:44:20,596 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 360 transitions, 5641 flow. Second operand has 25 states, 25 states have (on average 244.72) internal successors, (6118), 25 states have internal predecessors, (6118), 0 states have call successors, (0), 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-28 09:44:20,596 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:44:20,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 759 [2023-01-28 09:44:20,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:44:24,336 INFO L130 PetriNetUnfolder]: 751/1412 cut-off events. [2023-01-28 09:44:24,336 INFO L131 PetriNetUnfolder]: For 8009/8009 co-relation queries the response was YES. [2023-01-28 09:44:24,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10450 conditions, 1412 events. 751/1412 cut-off events. For 8009/8009 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7867 event pairs, 21 based on Foata normal form. 2/1414 useless extension candidates. Maximal degree in co-relation 10326. Up to 483 conditions per place. [2023-01-28 09:44:24,348 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 222 selfloop transitions, 208 changer transitions 8/438 dead transitions. [2023-01-28 09:44:24,348 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 438 transitions, 7142 flow [2023-01-28 09:44:24,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 09:44:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 09:44:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5734 transitions. [2023-01-28 09:44:24,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3284642263848313 [2023-01-28 09:44:24,355 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5734 transitions. [2023-01-28 09:44:24,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5734 transitions. [2023-01-28 09:44:24,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:44:24,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5734 transitions. [2023-01-28 09:44:24,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 249.30434782608697) internal successors, (5734), 23 states have internal predecessors, (5734), 0 states have call successors, (0), 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-28 09:44:24,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 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-28 09:44:24,373 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 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-28 09:44:24,373 INFO L175 Difference]: Start difference. First operand has 205 places, 360 transitions, 5641 flow. Second operand 23 states and 5734 transitions. [2023-01-28 09:44:24,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 438 transitions, 7142 flow [2023-01-28 09:44:24,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 438 transitions, 6900 flow, removed 17 selfloop flow, removed 15 redundant places. [2023-01-28 09:44:24,457 INFO L231 Difference]: Finished difference. Result has 215 places, 379 transitions, 6199 flow [2023-01-28 09:44:24,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5413, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=6199, PETRI_PLACES=215, PETRI_TRANSITIONS=379} [2023-01-28 09:44:24,458 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 195 predicate places. [2023-01-28 09:44:24,459 INFO L495 AbstractCegarLoop]: Abstraction has has 215 places, 379 transitions, 6199 flow [2023-01-28 09:44:24,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 244.72) internal successors, (6118), 25 states have internal predecessors, (6118), 0 states have call successors, (0), 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-28 09:44:24,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:44:24,459 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:44:24,471 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-28 09:44:24,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 09:44:24,669 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-28 09:44:24,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:44:24,669 INFO L85 PathProgramCache]: Analyzing trace with hash 761414257, now seen corresponding path program 9 times [2023-01-28 09:44:24,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:44:24,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507692646] [2023-01-28 09:44:24,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:44:24,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:44:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:44:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:44:25,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:44:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507692646] [2023-01-28 09:44:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507692646] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:44:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556027994] [2023-01-28 09:44:25,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 09:44:25,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:44:25,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:44:25,833 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-28 09:44:25,835 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-28 09:44:25,921 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 09:44:25,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:44:25,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-28 09:44:25,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:44:26,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:44:26,170 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 14 treesize of output 16 [2023-01-28 09:44:26,283 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 137 treesize of output 101 [2023-01-28 09:44:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:44:26,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:44:27,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:44:27,132 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 317 treesize of output 285 [2023-01-28 09:44:27,144 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 50 treesize of output 32 [2023-01-28 09:44:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:44:27,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556027994] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:44:27,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:44:27,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 24 [2023-01-28 09:44:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200322352] [2023-01-28 09:44:27,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:44:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 09:44:27,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:44:27,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 09:44:27,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=535, Unknown=1, NotChecked=0, Total=650 [2023-01-28 09:44:27,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 759 [2023-01-28 09:44:27,500 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 379 transitions, 6199 flow. Second operand has 26 states, 26 states have (on average 247.76923076923077) internal successors, (6442), 26 states have internal predecessors, (6442), 0 states have call successors, (0), 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-28 09:44:27,500 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:44:27,500 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 759 [2023-01-28 09:44:27,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:45:21,752 WARN L222 SmtUtils]: Spent 14.14s on a formula simplification. DAG size of input: 73 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:45:32,096 WARN L222 SmtUtils]: Spent 10.17s on a formula simplification. DAG size of input: 61 DAG size of output: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:45:38,850 INFO L130 PetriNetUnfolder]: 851/1609 cut-off events. [2023-01-28 09:45:38,850 INFO L131 PetriNetUnfolder]: For 10811/10811 co-relation queries the response was YES. [2023-01-28 09:45:38,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12261 conditions, 1609 events. 851/1609 cut-off events. For 10811/10811 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 9208 event pairs, 5 based on Foata normal form. 3/1612 useless extension candidates. Maximal degree in co-relation 12145. Up to 507 conditions per place. [2023-01-28 09:45:38,860 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 175 selfloop transitions, 366 changer transitions 10/551 dead transitions. [2023-01-28 09:45:38,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 551 transitions, 8782 flow [2023-01-28 09:45:38,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2023-01-28 09:45:38,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2023-01-28 09:45:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 14288 transitions. [2023-01-28 09:45:38,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3302591128678085 [2023-01-28 09:45:38,883 INFO L72 ComplementDD]: Start complementDD. Operand 57 states and 14288 transitions. [2023-01-28 09:45:38,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 14288 transitions. [2023-01-28 09:45:38,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:45:38,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 57 states and 14288 transitions. [2023-01-28 09:45:38,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 58 states, 57 states have (on average 250.66666666666666) internal successors, (14288), 57 states have internal predecessors, (14288), 0 states have call successors, (0), 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-28 09:45:38,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 58 states, 58 states have (on average 759.0) internal successors, (44022), 58 states have internal predecessors, (44022), 0 states have call successors, (0), 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-28 09:45:38,936 INFO L81 ComplementDD]: Finished complementDD. Result has 58 states, 58 states have (on average 759.0) internal successors, (44022), 58 states have internal predecessors, (44022), 0 states have call successors, (0), 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-28 09:45:38,936 INFO L175 Difference]: Start difference. First operand has 215 places, 379 transitions, 6199 flow. Second operand 57 states and 14288 transitions. [2023-01-28 09:45:38,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 551 transitions, 8782 flow [2023-01-28 09:45:39,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 551 transitions, 8656 flow, removed 10 selfloop flow, removed 14 redundant places. [2023-01-28 09:45:39,033 INFO L231 Difference]: Finished difference. Result has 264 places, 438 transitions, 7875 flow [2023-01-28 09:45:39,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=6085, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=311, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=57, PETRI_FLOW=7875, PETRI_PLACES=264, PETRI_TRANSITIONS=438} [2023-01-28 09:45:39,035 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 244 predicate places. [2023-01-28 09:45:39,035 INFO L495 AbstractCegarLoop]: Abstraction has has 264 places, 438 transitions, 7875 flow [2023-01-28 09:45:39,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 247.76923076923077) internal successors, (6442), 26 states have internal predecessors, (6442), 0 states have call successors, (0), 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-28 09:45:39,036 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:45:39,036 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:45:39,047 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-28 09:45:39,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 09:45:39,241 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-28 09:45:39,242 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:45:39,242 INFO L85 PathProgramCache]: Analyzing trace with hash 681692873, now seen corresponding path program 10 times [2023-01-28 09:45:39,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:45:39,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526775447] [2023-01-28 09:45:39,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:45:39,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:45:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:45:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:45:39,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:45:39,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526775447] [2023-01-28 09:45:39,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526775447] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:45:39,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159261952] [2023-01-28 09:45:39,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 09:45:39,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:45:39,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:45:39,392 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-28 09:45:39,394 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-28 09:45:39,491 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 09:45:39,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:45:39,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 09:45:39,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:45:39,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:45:39,654 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:45:39,838 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 209 treesize of output 193 [2023-01-28 09:45:39,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:45:39,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159261952] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:45:39,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:45:39,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-01-28 09:45:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659481873] [2023-01-28 09:45:39,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:45:39,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 09:45:39,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:45:39,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 09:45:39,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-01-28 09:45:39,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 759 [2023-01-28 09:45:39,915 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 438 transitions, 7875 flow. Second operand has 15 states, 15 states have (on average 274.8666666666667) internal successors, (4123), 15 states have internal predecessors, (4123), 0 states have call successors, (0), 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-28 09:45:39,915 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:45:39,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 759 [2023-01-28 09:45:39,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:45:40,460 INFO L130 PetriNetUnfolder]: 772/1470 cut-off events. [2023-01-28 09:45:40,460 INFO L131 PetriNetUnfolder]: For 11125/11125 co-relation queries the response was YES. [2023-01-28 09:45:40,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11781 conditions, 1470 events. 772/1470 cut-off events. For 11125/11125 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8265 event pairs, 127 based on Foata normal form. 79/1549 useless extension candidates. Maximal degree in co-relation 11724. Up to 668 conditions per place. [2023-01-28 09:45:40,474 INFO L137 encePairwiseOnDemand]: 751/759 looper letters, 231 selfloop transitions, 211 changer transitions 0/442 dead transitions. [2023-01-28 09:45:40,474 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 442 transitions, 8116 flow [2023-01-28 09:45:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 09:45:40,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 09:45:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4721 transitions. [2023-01-28 09:45:40,480 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3658839029683019 [2023-01-28 09:45:40,480 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4721 transitions. [2023-01-28 09:45:40,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4721 transitions. [2023-01-28 09:45:40,481 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:45:40,481 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4721 transitions. [2023-01-28 09:45:40,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 277.70588235294116) internal successors, (4721), 17 states have internal predecessors, (4721), 0 states have call successors, (0), 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-28 09:45:40,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 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-28 09:45:40,492 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 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-28 09:45:40,492 INFO L175 Difference]: Start difference. First operand has 264 places, 438 transitions, 7875 flow. Second operand 17 states and 4721 transitions. [2023-01-28 09:45:40,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 442 transitions, 8116 flow [2023-01-28 09:45:40,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 442 transitions, 7513 flow, removed 97 selfloop flow, removed 31 redundant places. [2023-01-28 09:45:40,582 INFO L231 Difference]: Finished difference. Result has 237 places, 396 transitions, 6806 flow [2023-01-28 09:45:40,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=6003, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=196, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=6806, PETRI_PLACES=237, PETRI_TRANSITIONS=396} [2023-01-28 09:45:40,583 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 217 predicate places. [2023-01-28 09:45:40,583 INFO L495 AbstractCegarLoop]: Abstraction has has 237 places, 396 transitions, 6806 flow [2023-01-28 09:45:40,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 274.8666666666667) internal successors, (4123), 15 states have internal predecessors, (4123), 0 states have call successors, (0), 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-28 09:45:40,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:45:40,584 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:45:40,589 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-28 09:45:40,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 09:45:40,789 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-28 09:45:40,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:45:40,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1250955687, now seen corresponding path program 11 times [2023-01-28 09:45:40,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:45:40,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641519884] [2023-01-28 09:45:40,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:45:40,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:45:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:45:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:40,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:45:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641519884] [2023-01-28 09:45:40,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641519884] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:45:40,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391783446] [2023-01-28 09:45:40,930 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 09:45:40,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:45:40,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:45:40,931 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-28 09:45:40,934 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-28 09:45:41,027 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:45:41,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:45:41,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 12 conjunts are in the unsatisfiable core [2023-01-28 09:45:41,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:45:41,255 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:41,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:45:41,560 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 09:45:41,561 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 353 treesize of output 249 [2023-01-28 09:45:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:41,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391783446] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:45:41,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:45:41,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-01-28 09:45:41,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515717775] [2023-01-28 09:45:41,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:45:41,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 09:45:41,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:45:41,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 09:45:41,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-01-28 09:45:41,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 759 [2023-01-28 09:45:41,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 396 transitions, 6806 flow. Second operand has 13 states, 13 states have (on average 266.7692307692308) internal successors, (3468), 13 states have internal predecessors, (3468), 0 states have call successors, (0), 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-28 09:45:41,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:45:41,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 759 [2023-01-28 09:45:41,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:45:41,999 INFO L130 PetriNetUnfolder]: 526/1076 cut-off events. [2023-01-28 09:45:41,999 INFO L131 PetriNetUnfolder]: For 6646/6646 co-relation queries the response was YES. [2023-01-28 09:45:42,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8586 conditions, 1076 events. 526/1076 cut-off events. For 6646/6646 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5896 event pairs, 97 based on Foata normal form. 82/1158 useless extension candidates. Maximal degree in co-relation 8541. Up to 409 conditions per place. [2023-01-28 09:45:42,008 INFO L137 encePairwiseOnDemand]: 754/759 looper letters, 260 selfloop transitions, 49 changer transitions 19/328 dead transitions. [2023-01-28 09:45:42,008 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 328 transitions, 6155 flow [2023-01-28 09:45:42,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 09:45:42,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 09:45:42,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2163 transitions. [2023-01-28 09:45:42,016 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35622529644268774 [2023-01-28 09:45:42,016 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2163 transitions. [2023-01-28 09:45:42,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2163 transitions. [2023-01-28 09:45:42,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:45:42,017 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2163 transitions. [2023-01-28 09:45:42,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 270.375) internal successors, (2163), 8 states have internal predecessors, (2163), 0 states have call successors, (0), 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-28 09:45:42,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 759.0) internal successors, (6831), 9 states have internal predecessors, (6831), 0 states have call successors, (0), 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-28 09:45:42,024 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 759.0) internal successors, (6831), 9 states have internal predecessors, (6831), 0 states have call successors, (0), 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-28 09:45:42,024 INFO L175 Difference]: Start difference. First operand has 237 places, 396 transitions, 6806 flow. Second operand 8 states and 2163 transitions. [2023-01-28 09:45:42,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 328 transitions, 6155 flow [2023-01-28 09:45:42,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 328 transitions, 5838 flow, removed 26 selfloop flow, removed 18 redundant places. [2023-01-28 09:45:42,095 INFO L231 Difference]: Finished difference. Result has 224 places, 295 transitions, 5022 flow [2023-01-28 09:45:42,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=5125, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5022, PETRI_PLACES=224, PETRI_TRANSITIONS=295} [2023-01-28 09:45:42,096 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 204 predicate places. [2023-01-28 09:45:42,096 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 295 transitions, 5022 flow [2023-01-28 09:45:42,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 266.7692307692308) internal successors, (3468), 13 states have internal predecessors, (3468), 0 states have call successors, (0), 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-28 09:45:42,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:45:42,096 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:45:42,104 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-28 09:45:42,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 09:45:42,304 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-28 09:45:42,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:45:42,305 INFO L85 PathProgramCache]: Analyzing trace with hash 265595398, now seen corresponding path program 12 times [2023-01-28 09:45:42,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:45:42,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257100497] [2023-01-28 09:45:42,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:45:42,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:45:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:45:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:45:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257100497] [2023-01-28 09:45:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257100497] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:45:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473351447] [2023-01-28 09:45:42,434 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 09:45:42,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:45:42,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:45:42,435 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-28 09:45:42,438 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-28 09:45:42,538 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-01-28 09:45:42,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:45:42,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 9 conjunts are in the unsatisfiable core [2023-01-28 09:45:42,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:45:42,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:42,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:45:43,363 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 09:45:43,363 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 237 treesize of output 205 [2023-01-28 09:45:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:43,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473351447] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:45:43,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:45:43,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 13 [2023-01-28 09:45:43,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393538607] [2023-01-28 09:45:43,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:45:43,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-01-28 09:45:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:45:43,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-01-28 09:45:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-01-28 09:45:43,410 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 759 [2023-01-28 09:45:43,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 295 transitions, 5022 flow. Second operand has 13 states, 13 states have (on average 255.0) internal successors, (3315), 13 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:45:43,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:45:43,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 759 [2023-01-28 09:45:43,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:45:43,790 INFO L130 PetriNetUnfolder]: 376/729 cut-off events. [2023-01-28 09:45:43,790 INFO L131 PetriNetUnfolder]: For 5282/5282 co-relation queries the response was YES. [2023-01-28 09:45:43,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5595 conditions, 729 events. 376/729 cut-off events. For 5282/5282 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3314 event pairs, 16 based on Foata normal form. 19/748 useless extension candidates. Maximal degree in co-relation 5556. Up to 250 conditions per place. [2023-01-28 09:45:43,795 INFO L137 encePairwiseOnDemand]: 750/759 looper letters, 131 selfloop transitions, 91 changer transitions 29/251 dead transitions. [2023-01-28 09:45:43,795 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 251 transitions, 4085 flow [2023-01-28 09:45:43,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-01-28 09:45:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-01-28 09:45:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4379 transitions. [2023-01-28 09:45:43,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33937843912268467 [2023-01-28 09:45:43,799 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 4379 transitions. [2023-01-28 09:45:43,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 4379 transitions. [2023-01-28 09:45:43,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:45:43,800 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 4379 transitions. [2023-01-28 09:45:43,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 257.5882352941176) internal successors, (4379), 17 states have internal predecessors, (4379), 0 states have call successors, (0), 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-28 09:45:43,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 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-28 09:45:43,812 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 759.0) internal successors, (13662), 18 states have internal predecessors, (13662), 0 states have call successors, (0), 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-28 09:45:43,812 INFO L175 Difference]: Start difference. First operand has 224 places, 295 transitions, 5022 flow. Second operand 17 states and 4379 transitions. [2023-01-28 09:45:43,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 251 transitions, 4085 flow [2023-01-28 09:45:43,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 251 transitions, 3835 flow, removed 9 selfloop flow, removed 27 redundant places. [2023-01-28 09:45:43,845 INFO L231 Difference]: Finished difference. Result has 171 places, 188 transitions, 3133 flow [2023-01-28 09:45:43,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2581, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=3133, PETRI_PLACES=171, PETRI_TRANSITIONS=188} [2023-01-28 09:45:43,846 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 151 predicate places. [2023-01-28 09:45:43,846 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 188 transitions, 3133 flow [2023-01-28 09:45:43,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 255.0) internal successors, (3315), 13 states have internal predecessors, (3315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-01-28 09:45:43,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:45:43,847 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:45:43,852 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-28 09:45:44,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 09:45:44,057 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-28 09:45:44,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:45:44,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1735114768, now seen corresponding path program 13 times [2023-01-28 09:45:44,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:45:44,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808971104] [2023-01-28 09:45:44,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:45:44,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:45:44,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:45:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 09:45:47,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:45:47,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808971104] [2023-01-28 09:45:47,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808971104] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:45:47,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642270737] [2023-01-28 09:45:47,423 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 09:45:47,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:45:47,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:45:47,425 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-28 09:45:47,454 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-28 09:45:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:45:47,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 49 conjunts are in the unsatisfiable core [2023-01-28 09:45:47,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:45:48,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:45:48,556 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 240 treesize of output 160 [2023-01-28 09:45:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 09:45:48,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:45:51,367 INFO L321 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-01-28 09:45:51,367 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 1173 treesize of output 585 [2023-01-28 09:46:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 09:46:01,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642270737] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:46:01,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:46:01,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 25 [2023-01-28 09:46:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230674401] [2023-01-28 09:46:01,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:46:01,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-01-28 09:46:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:46:01,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-01-28 09:46:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2023-01-28 09:46:01,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 759 [2023-01-28 09:46:01,319 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 188 transitions, 3133 flow. Second operand has 26 states, 26 states have (on average 240.1153846153846) internal successors, (6243), 26 states have internal predecessors, (6243), 0 states have call successors, (0), 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-28 09:46:01,319 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:46:01,320 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 759 [2023-01-28 09:46:01,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:46:03,158 INFO L130 PetriNetUnfolder]: 527/937 cut-off events. [2023-01-28 09:46:03,158 INFO L131 PetriNetUnfolder]: For 9133/9133 co-relation queries the response was YES. [2023-01-28 09:46:03,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7753 conditions, 937 events. 527/937 cut-off events. For 9133/9133 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4348 event pairs, 18 based on Foata normal form. 1/938 useless extension candidates. Maximal degree in co-relation 7711. Up to 527 conditions per place. [2023-01-28 09:46:03,163 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 171 selfloop transitions, 132 changer transitions 8/311 dead transitions. [2023-01-28 09:46:03,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 311 transitions, 5336 flow [2023-01-28 09:46:03,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-01-28 09:46:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-01-28 09:46:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5592 transitions. [2023-01-28 09:46:03,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32032995360027494 [2023-01-28 09:46:03,167 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 5592 transitions. [2023-01-28 09:46:03,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 5592 transitions. [2023-01-28 09:46:03,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:46:03,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 5592 transitions. [2023-01-28 09:46:03,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 243.1304347826087) internal successors, (5592), 23 states have internal predecessors, (5592), 0 states have call successors, (0), 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-28 09:46:03,183 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 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-28 09:46:03,184 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 759.0) internal successors, (18216), 24 states have internal predecessors, (18216), 0 states have call successors, (0), 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-28 09:46:03,185 INFO L175 Difference]: Start difference. First operand has 171 places, 188 transitions, 3133 flow. Second operand 23 states and 5592 transitions. [2023-01-28 09:46:03,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 311 transitions, 5336 flow [2023-01-28 09:46:03,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 311 transitions, 5120 flow, removed 22 selfloop flow, removed 12 redundant places. [2023-01-28 09:46:03,239 INFO L231 Difference]: Finished difference. Result has 160 places, 250 transitions, 4498 flow [2023-01-28 09:46:03,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=2975, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=4498, PETRI_PLACES=160, PETRI_TRANSITIONS=250} [2023-01-28 09:46:03,239 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 140 predicate places. [2023-01-28 09:46:03,239 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 250 transitions, 4498 flow [2023-01-28 09:46:03,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 240.1153846153846) internal successors, (6243), 26 states have internal predecessors, (6243), 0 states have call successors, (0), 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-28 09:46:03,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:46:03,241 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:46:03,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-01-28 09:46:03,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:46:03,450 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-28 09:46:03,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:46:03,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1929977428, now seen corresponding path program 14 times [2023-01-28 09:46:03,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:46:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49855787] [2023-01-28 09:46:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:46:03,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:46:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:46:07,445 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-28 09:46:07,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:46:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49855787] [2023-01-28 09:46:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49855787] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:46:07,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998339630] [2023-01-28 09:46:07,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 09:46:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:46:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:46:07,446 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-28 09:46:07,450 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-28 09:46:07,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 09:46:07,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:46:07,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 72 conjunts are in the unsatisfiable core [2023-01-28 09:46:07,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:46:08,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:46:08,044 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 60 treesize of output 56 [2023-01-28 09:46:09,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:46:09,206 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 221 treesize of output 149 [2023-01-28 09:46:09,334 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-28 09:46:09,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:46:13,401 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse32 (* c_~j~0 4))) (let ((.cse9 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse10 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse4 (+ c_~A~0.offset .cse32)) (.cse5 (+ c_~A~0.offset .cse32 4)) (.cse6 (+ c_~A~0.offset (* c_~i~0 4))) (.cse7 (< (+ 2 c_~j~0) c_~N~0)) (.cse8 (<= c_~N~0 (+ c_~j~0 1))) (.cse19 (< (+ c_~i~0 1) c_~N~0))) (and (or (and (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse6)) (.cse1 (select .cse3 .cse5)) (.cse2 (select .cse3 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse0 1)) (< (+ .cse1 c_~bag2~0 .cse2 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse0)) (= (+ .cse1 c_~bag2~0 c_~sum2~0 .cse2) (+ c_~bag1~0 c_~sum1~0 .cse0)) (< (+ c_~bag1~0 .cse0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse2)) (< 2147483647 (+ .cse1 c_~bag2~0 .cse2)) (< (+ c_~bag2~0 .cse2 2147483648) 0))))) .cse7 .cse8) (or .cse9 .cse10 (and (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse11 (select .cse14 .cse6)) (.cse12 (select .cse14 .cse5)) (.cse13 (select .cse14 .cse4))) (or (< c_~cap1~0 (+ c_~bag1~0 .cse11 1)) (< 2147483647 (+ c_~bag1~0 .cse11)) (< (+ .cse12 .cse13 2147483648) 0) (= (+ .cse12 c_~bag2~0 c_~sum2~0 .cse13) (+ c_~bag1~0 c_~sum1~0 .cse11)) (< (+ c_~bag1~0 .cse11 2147483648) 0) (< c_~bag2~0 (+ .cse12 1)) (< 2147483647 (+ c_~bag2~0 .cse13)))))) .cse7 .cse8) (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse16 (select .cse18 .cse6)) (.cse17 (select .cse18 .cse5)) (.cse15 (select .cse18 .cse4))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse15 2147483648) 0) (< c_~cap1~0 (+ c_~bag1~0 .cse16 1)) (< 2147483647 (+ c_~bag1~0 .cse16)) (< (+ .cse17 .cse15 2147483648) 0) (= (+ .cse17 c_~bag2~0 c_~sum2~0 .cse15) (+ c_~bag1~0 c_~sum1~0 .cse16)) (< (+ c_~bag1~0 .cse16 2147483648) 0) (< 2147483647 (+ .cse17 .cse15)) (< 2147483647 (+ c_~bag2~0 .cse15)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse15)) (< (+ c_~bag2~0 .cse15 2147483648) 0))))) .cse7 .cse8)))) .cse19) (or (< 2147483647 c_~cap1~0) (< 2147483647 (+ c_~bag1~0 c_~sum1~0)) (and (or (and (or .cse7 .cse8 (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse6)) (.cse21 (select .cse23 .cse5)) (.cse22 (select .cse23 .cse4))) (or (< 2147483647 (+ c_~bag1~0 .cse20)) (< (+ .cse21 .cse22 2147483648) 0) (= (+ .cse21 c_~bag2~0 c_~sum2~0 .cse22) (+ c_~bag1~0 c_~sum1~0 .cse20)) (< c_~bag2~0 (+ .cse21 1)) (< 2147483647 (+ c_~bag2~0 .cse22))))))) (or .cse7 .cse8 (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse27 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse25 (select .cse27 .cse6)) (.cse26 (select .cse27 .cse5)) (.cse24 (select .cse27 .cse4))) (or (< (+ c_~bag2~0 c_~sum2~0 .cse24 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse25)) (< (+ .cse26 .cse24 2147483648) 0) (= (+ .cse26 c_~bag2~0 c_~sum2~0 .cse24) (+ c_~bag1~0 c_~sum1~0 .cse25)) (< 2147483647 (+ .cse26 .cse24)) (< 2147483647 (+ c_~bag2~0 .cse24)) (< 2147483647 (+ c_~bag2~0 c_~sum2~0 .cse24)) (< (+ c_~bag2~0 .cse24 2147483648) 0))))))) .cse9 .cse10) (or (forall ((v_ArrVal_543 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_543) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse6)) (.cse28 (select .cse31 .cse5)) (.cse29 (select .cse31 .cse4))) (or (< (+ .cse28 c_~bag2~0 .cse29 2147483648) 0) (< 2147483647 (+ c_~bag1~0 .cse30)) (= (+ .cse28 c_~bag2~0 c_~sum2~0 .cse29) (+ c_~bag1~0 c_~sum1~0 .cse30)) (< 2147483647 (+ c_~bag2~0 .cse29)) (< 2147483647 (+ .cse28 c_~bag2~0 .cse29)) (< (+ c_~bag2~0 .cse29 2147483648) 0))))) .cse7 .cse8)) (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19)))) (<= c_~N~0 c_~i~0)) is different from false [2023-01-28 09:46:17,663 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:46:17,664 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 4550 treesize of output 2948 [2023-01-28 09:46:17,866 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:17,867 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 2854 treesize of output 2782 [2023-01-28 09:46:18,047 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,047 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 2775 treesize of output 2727 [2023-01-28 09:46:18,170 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,171 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 2720 treesize of output 2660 [2023-01-28 09:46:18,301 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,302 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 2653 treesize of output 2598 [2023-01-28 09:46:18,355 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 09:46:18,448 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,448 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 2591 treesize of output 2512 [2023-01-28 09:46:18,609 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,609 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 2505 treesize of output 2438 [2023-01-28 09:46:18,731 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,732 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 2431 treesize of output 2376 [2023-01-28 09:46:18,855 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:18,855 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 2369 treesize of output 2290 [2023-01-28 09:46:19,020 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:19,021 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 2283 treesize of output 2216 [2023-01-28 09:46:19,097 INFO L208 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2023-01-28 09:46:19,171 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:19,171 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 2209 treesize of output 2137 [2023-01-28 09:46:19,295 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:19,296 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 2130 treesize of output 2082 [2023-01-28 09:46:19,419 INFO L321 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-01-28 09:46:19,420 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 2075 treesize of output 2015 [2023-01-28 09:46:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 09:46:22,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998339630] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:46:22,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:46:22,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2023-01-28 09:46:22,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550486262] [2023-01-28 09:46:22,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:46:22,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-01-28 09:46:22,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:46:22,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-01-28 09:46:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1192, Unknown=1, NotChecked=72, Total=1482 [2023-01-28 09:46:22,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-28 09:46:22,421 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 250 transitions, 4498 flow. Second operand has 39 states, 39 states have (on average 232.48717948717947) internal successors, (9067), 39 states have internal predecessors, (9067), 0 states have call successors, (0), 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-28 09:46:22,421 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:46:22,421 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-28 09:46:22,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:46:57,015 WARN L222 SmtUtils]: Spent 6.04s on a formula simplification. DAG size of input: 288 DAG size of output: 254 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:47:22,915 INFO L130 PetriNetUnfolder]: 1503/2661 cut-off events. [2023-01-28 09:47:22,915 INFO L131 PetriNetUnfolder]: For 26526/26526 co-relation queries the response was YES. [2023-01-28 09:47:22,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22685 conditions, 2661 events. 1503/2661 cut-off events. For 26526/26526 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 15819 event pairs, 2 based on Foata normal form. 18/2679 useless extension candidates. Maximal degree in co-relation 22640. Up to 860 conditions per place. [2023-01-28 09:47:22,931 INFO L137 encePairwiseOnDemand]: 747/759 looper letters, 268 selfloop transitions, 660 changer transitions 38/966 dead transitions. [2023-01-28 09:47:22,932 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 966 transitions, 16438 flow [2023-01-28 09:47:22,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-01-28 09:47:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-01-28 09:47:22,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 19385 transitions. [2023-01-28 09:47:22,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31146566406375525 [2023-01-28 09:47:22,951 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 19385 transitions. [2023-01-28 09:47:22,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 19385 transitions. [2023-01-28 09:47:22,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:47:22,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 19385 transitions. [2023-01-28 09:47:22,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 236.40243902439025) internal successors, (19385), 82 states have internal predecessors, (19385), 0 states have call successors, (0), 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-28 09:47:23,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 759.0) internal successors, (62997), 83 states have internal predecessors, (62997), 0 states have call successors, (0), 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-28 09:47:23,016 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 759.0) internal successors, (62997), 83 states have internal predecessors, (62997), 0 states have call successors, (0), 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-28 09:47:23,016 INFO L175 Difference]: Start difference. First operand has 160 places, 250 transitions, 4498 flow. Second operand 82 states and 19385 transitions. [2023-01-28 09:47:23,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 966 transitions, 16438 flow [2023-01-28 09:47:23,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 966 transitions, 15833 flow, removed 189 selfloop flow, removed 10 redundant places. [2023-01-28 09:47:23,204 INFO L231 Difference]: Finished difference. Result has 244 places, 730 transitions, 14508 flow [2023-01-28 09:47:23,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=4213, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=197, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=14508, PETRI_PLACES=244, PETRI_TRANSITIONS=730} [2023-01-28 09:47:23,205 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 224 predicate places. [2023-01-28 09:47:23,205 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 730 transitions, 14508 flow [2023-01-28 09:47:23,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 232.48717948717947) internal successors, (9067), 39 states have internal predecessors, (9067), 0 states have call successors, (0), 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-28 09:47:23,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:47:23,206 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:47:23,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-01-28 09:47:23,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:47:23,411 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-28 09:47:23,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:47:23,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1040341450, now seen corresponding path program 15 times [2023-01-28 09:47:23,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:47:23,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255266861] [2023-01-28 09:47:23,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:47:23,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:47:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:47:26,017 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-28 09:47:26,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:47:26,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255266861] [2023-01-28 09:47:26,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255266861] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:47:26,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468523532] [2023-01-28 09:47:26,018 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 09:47:26,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:47:26,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:47:26,019 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-28 09:47:26,020 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-28 09:47:26,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 09:47:26,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:47:26,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 84 conjunts are in the unsatisfiable core [2023-01-28 09:47:26,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:47:26,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:47:26,325 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 14 treesize of output 16 [2023-01-28 09:47:27,018 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:47:27,018 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 319 treesize of output 191 [2023-01-28 09:47:27,358 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-28 09:47:27,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:47:35,537 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:35,538 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 2568 treesize of output 1822 [2023-01-28 09:47:35,615 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:35,616 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 1784 treesize of output 1697 [2023-01-28 09:47:35,688 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:35,689 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 1670 treesize of output 1607 [2023-01-28 09:47:35,767 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:35,768 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 1580 treesize of output 1505 [2023-01-28 09:47:35,847 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:35,848 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 1478 treesize of output 1427 [2023-01-28 09:47:35,929 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:35,929 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 1400 treesize of output 1325 [2023-01-28 09:47:36,025 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:47:36,025 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 1298 treesize of output 1235 [2023-01-28 09:48:52,364 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:48:52,365 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 1395 treesize of output 1003 [2023-01-28 09:48:52,532 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:48:52,533 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 902 treesize of output 839 [2023-01-28 09:48:52,604 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:48:52,605 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 812 treesize of output 725 [2023-01-28 09:48:52,675 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:48:52,676 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 698 treesize of output 623 [2023-01-28 09:49:16,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 09:49:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468523532] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:49:16,282 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:49:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 36 [2023-01-28 09:49:16,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444773881] [2023-01-28 09:49:16,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:49:16,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-01-28 09:49:16,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:49:16,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-01-28 09:49:16,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1153, Unknown=1, NotChecked=0, Total=1332 [2023-01-28 09:49:16,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-28 09:49:16,289 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 730 transitions, 14508 flow. Second operand has 37 states, 37 states have (on average 232.48648648648648) internal successors, (8602), 37 states have internal predecessors, (8602), 0 states have call successors, (0), 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-28 09:49:16,289 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:49:16,289 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-28 09:49:16,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:49:51,289 WARN L222 SmtUtils]: Spent 11.94s on a formula simplification. DAG size of input: 266 DAG size of output: 212 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:50:28,237 INFO L130 PetriNetUnfolder]: 2413/4253 cut-off events. [2023-01-28 09:50:28,238 INFO L131 PetriNetUnfolder]: For 70830/70830 co-relation queries the response was YES. [2023-01-28 09:50:28,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43532 conditions, 4253 events. 2413/4253 cut-off events. For 70830/70830 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 27456 event pairs, 37 based on Foata normal form. 24/4277 useless extension candidates. Maximal degree in co-relation 43472. Up to 1274 conditions per place. [2023-01-28 09:50:28,268 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 439 selfloop transitions, 1063 changer transitions 24/1526 dead transitions. [2023-01-28 09:50:28,268 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 1526 transitions, 31552 flow [2023-01-28 09:50:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2023-01-28 09:50:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2023-01-28 09:50:28,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 26712 transitions. [2023-01-28 09:50:28,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31144845919759345 [2023-01-28 09:50:28,292 INFO L72 ComplementDD]: Start complementDD. Operand 113 states and 26712 transitions. [2023-01-28 09:50:28,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 26712 transitions. [2023-01-28 09:50:28,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:50:28,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 113 states and 26712 transitions. [2023-01-28 09:50:28,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 114 states, 113 states have (on average 236.38938053097345) internal successors, (26712), 113 states have internal predecessors, (26712), 0 states have call successors, (0), 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-28 09:50:28,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 114 states, 114 states have (on average 759.0) internal successors, (86526), 114 states have internal predecessors, (86526), 0 states have call successors, (0), 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-28 09:50:28,384 INFO L81 ComplementDD]: Finished complementDD. Result has 114 states, 114 states have (on average 759.0) internal successors, (86526), 114 states have internal predecessors, (86526), 0 states have call successors, (0), 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-28 09:50:28,384 INFO L175 Difference]: Start difference. First operand has 244 places, 730 transitions, 14508 flow. Second operand 113 states and 26712 transitions. [2023-01-28 09:50:28,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 1526 transitions, 31552 flow [2023-01-28 09:50:28,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1526 transitions, 29510 flow, removed 425 selfloop flow, removed 12 redundant places. [2023-01-28 09:50:28,945 INFO L231 Difference]: Finished difference. Result has 351 places, 1229 transitions, 26071 flow [2023-01-28 09:50:28,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=13305, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=608, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=113, PETRI_FLOW=26071, PETRI_PLACES=351, PETRI_TRANSITIONS=1229} [2023-01-28 09:50:28,946 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 331 predicate places. [2023-01-28 09:50:28,946 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 1229 transitions, 26071 flow [2023-01-28 09:50:28,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 232.48648648648648) internal successors, (8602), 37 states have internal predecessors, (8602), 0 states have call successors, (0), 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-28 09:50:28,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:50:28,947 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:50:28,957 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-28 09:50:29,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:50:29,153 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-28 09:50:29,153 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:50:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1068047080, now seen corresponding path program 16 times [2023-01-28 09:50:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:50:29,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102721551] [2023-01-28 09:50:29,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:50:29,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:50:29,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:51:03,382 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-28 09:51:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:51:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102721551] [2023-01-28 09:51:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102721551] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:51:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083098387] [2023-01-28 09:51:03,382 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 09:51:03,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:51:03,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:51:03,383 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-28 09:51:03,385 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-28 09:51:03,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 09:51:03,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:51:03,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 69 conjunts are in the unsatisfiable core [2023-01-28 09:51:03,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:51:03,572 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-28 09:51:03,631 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-28 09:51:03,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-28 09:51:04,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:51:04,591 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 268 treesize of output 180 [2023-01-28 09:51:04,988 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-28 09:51:04,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:51:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 09:51:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083098387] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:51:19,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:51:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 10] total 32 [2023-01-28 09:51:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726134148] [2023-01-28 09:51:19,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:51:19,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 09:51:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:51:19,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 09:51:19,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=877, Unknown=3, NotChecked=0, Total=1056 [2023-01-28 09:51:19,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-28 09:51:19,764 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 1229 transitions, 26071 flow. Second operand has 33 states, 33 states have (on average 232.63636363636363) internal successors, (7677), 33 states have internal predecessors, (7677), 0 states have call successors, (0), 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-28 09:51:19,764 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:51:19,764 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-28 09:51:19,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:51:49,143 WARN L222 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 279 DAG size of output: 269 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:52:21,567 INFO L130 PetriNetUnfolder]: 2210/3873 cut-off events. [2023-01-28 09:52:21,567 INFO L131 PetriNetUnfolder]: For 61034/61034 co-relation queries the response was YES. [2023-01-28 09:52:21,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40966 conditions, 3873 events. 2210/3873 cut-off events. For 61034/61034 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 24433 event pairs, 35 based on Foata normal form. 17/3890 useless extension candidates. Maximal degree in co-relation 40895. Up to 1148 conditions per place. [2023-01-28 09:52:21,599 INFO L137 encePairwiseOnDemand]: 749/759 looper letters, 308 selfloop transitions, 992 changer transitions 23/1323 dead transitions. [2023-01-28 09:52:21,599 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1323 transitions, 29203 flow [2023-01-28 09:52:21,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-01-28 09:52:21,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-01-28 09:52:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 16518 transitions. [2023-01-28 09:52:21,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3108977978543196 [2023-01-28 09:52:21,610 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 16518 transitions. [2023-01-28 09:52:21,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 16518 transitions. [2023-01-28 09:52:21,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:52:21,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 16518 transitions. [2023-01-28 09:52:21,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 235.97142857142856) internal successors, (16518), 70 states have internal predecessors, (16518), 0 states have call successors, (0), 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-28 09:52:21,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 759.0) internal successors, (53889), 71 states have internal predecessors, (53889), 0 states have call successors, (0), 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-28 09:52:21,726 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 759.0) internal successors, (53889), 71 states have internal predecessors, (53889), 0 states have call successors, (0), 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-28 09:52:21,726 INFO L175 Difference]: Start difference. First operand has 351 places, 1229 transitions, 26071 flow. Second operand 70 states and 16518 transitions. [2023-01-28 09:52:21,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1323 transitions, 29203 flow [2023-01-28 09:52:22,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1323 transitions, 27195 flow, removed 917 selfloop flow, removed 24 redundant places. [2023-01-28 09:52:22,322 INFO L231 Difference]: Finished difference. Result has 380 places, 1154 transitions, 25275 flow [2023-01-28 09:52:22,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=19628, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=996, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=839, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=25275, PETRI_PLACES=380, PETRI_TRANSITIONS=1154} [2023-01-28 09:52:22,323 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 360 predicate places. [2023-01-28 09:52:22,323 INFO L495 AbstractCegarLoop]: Abstraction has has 380 places, 1154 transitions, 25275 flow [2023-01-28 09:52:22,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 232.63636363636363) internal successors, (7677), 33 states have internal predecessors, (7677), 0 states have call successors, (0), 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-28 09:52:22,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:52:22,324 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:52:22,331 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-28 09:52:22,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:52:22,525 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-28 09:52:22,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:52:22,525 INFO L85 PathProgramCache]: Analyzing trace with hash -105131752, now seen corresponding path program 17 times [2023-01-28 09:52:22,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:52:22,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911735692] [2023-01-28 09:52:22,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:52:22,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:52:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:52:24,691 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-28 09:52:24,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:52:24,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911735692] [2023-01-28 09:52:24,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911735692] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:52:24,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57665654] [2023-01-28 09:52:24,692 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 09:52:24,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:52:24,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:52:24,693 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-28 09:52:24,695 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-28 09:52:24,809 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-01-28 09:52:24,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:52:24,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 97 conjunts are in the unsatisfiable core [2023-01-28 09:52:24,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:52:24,890 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-28 09:52:24,972 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-28 09:52:25,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:52:25,675 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 36 treesize of output 32 [2023-01-28 09:52:26,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:52:26,084 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 234 treesize of output 154 [2023-01-28 09:52:26,283 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-28 09:52:26,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:52:34,898 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse8 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse1 (< 2 c_~N~0)) (.cse0 (<= c_~N~0 1)) (.cse2 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse27 (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse26 (select .cse27 .cse8))) (let ((.cse21 (+ .cse25 .cse26))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse19 (select .cse23 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse20 (select .cse23 .cse8))) (let ((.cse22 (+ .cse19 .cse20))) (or (< (+ .cse19 2147483648 .cse20) 0) (= .cse21 .cse22) (< (+ .cse19 2147483648) 0) (< 2147483647 .cse19) (< 2147483647 .cse22)))))) (< (+ .cse25 .cse26 2147483648) 0) (< (+ .cse25 2147483648) 0) (< 2147483647 .cse25) (< 2147483647 .cse21))))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse35 (select .cse34 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse28 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse29 (select .cse35 .cse8))) (let ((.cse32 (+ .cse28 .cse29))) (or (< (+ .cse28 .cse29 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse33 (select (store .cse34 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse33 .cse8))) (or (< (+ .cse30 2147483648 .cse31) 0) (= .cse32 (+ .cse30 .cse31)) (< 2147483647 .cse30) (< 0 (+ .cse31 1)))))) (< (+ .cse28 2147483648) 0) (< 2147483647 .cse28) (< 2147483647 .cse32)))))))))) (and (or .cse0 (and (or .cse1 .cse2) (or .cse1 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse10 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse4 (select .cse10 .cse8)) (.cse3 (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse3 .cse4 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse7 (select (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse6 (select .cse7 .cse8))) (or (< (+ .cse5 2147483648 .cse6) 0) (= (+ .cse3 .cse4) (+ .cse5 .cse6)) (< 2147483647 .cse5) (< 0 (+ .cse6 1)))))) (< 0 (+ .cse4 1)) (< 2147483647 .cse3)))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse14 (select .cse18 .cse8)) (.cse13 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse11 (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (select .cse16 .cse8))) (let ((.cse15 (+ .cse11 .cse12))) (or (< (+ .cse11 2147483648 .cse12) 0) (= (+ .cse13 .cse14) .cse15) (< (+ .cse11 2147483648) 0) (< 2147483647 .cse11) (< 2147483647 .cse15)))))) (< (+ .cse13 .cse14 2147483648) 0) (< 0 (+ .cse14 1)) (< 2147483647 .cse13)))))))))) (or .cse1 .cse0 .cse2)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2023-01-28 09:52:35,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:52:35,165 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 1 case distinctions, treesize of input 386 treesize of output 206 [2023-01-28 09:52:35,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:52:35,175 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 584 treesize of output 488 [2023-01-28 09:52:35,201 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 292 treesize of output 248 [2023-01-28 09:52:35,216 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:52:35,216 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 184 treesize of output 146 [2023-01-28 09:52:35,278 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 09:52:35,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 337 treesize of output 1 [2023-01-28 09:52:35,290 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 09:52:35,291 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 1 case distinctions, treesize of input 343 treesize of output 1 [2023-01-28 09:52:35,299 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 09:52:35,299 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 1 case distinctions, treesize of input 294 treesize of output 1 [2023-01-28 09:52:35,315 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 09:52:35,315 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 1 case distinctions, treesize of input 386 treesize of output 1 [2023-01-28 09:52:35,324 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 09:52:35,324 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 1 case distinctions, treesize of input 337 treesize of output 1 [2023-01-28 09:52:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-01-28 09:52:35,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57665654] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:52:35,458 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:52:35,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2023-01-28 09:52:35,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538501036] [2023-01-28 09:52:35,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:52:35,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-01-28 09:52:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:52:35,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-01-28 09:52:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1252, Unknown=18, NotChecked=74, Total=1560 [2023-01-28 09:52:35,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-28 09:52:35,466 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 1154 transitions, 25275 flow. Second operand has 40 states, 40 states have (on average 232.45) internal successors, (9298), 40 states have internal predecessors, (9298), 0 states have call successors, (0), 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-28 09:52:35,466 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:52:35,466 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-28 09:52:35,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:52:35,807 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (< 2 c_~N~0)) (.cse1 (<= c_~N~0 1)) (.cse3 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or .cse0 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse3)) (or (let ((.cse10 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse4 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse26 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse29 (select .cse26 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse27 (select .cse29 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse28 (select .cse29 .cse10))) (let ((.cse23 (+ .cse27 .cse28))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse25 (select (store .cse26 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse21 (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse22 (select .cse25 .cse10))) (let ((.cse24 (+ .cse21 .cse22))) (or (< (+ .cse21 2147483648 .cse22) 0) (= .cse23 .cse24) (< (+ .cse21 2147483648) 0) (< 2147483647 .cse21) (< 2147483647 .cse24)))))) (< (+ .cse27 .cse28 2147483648) 0) (< (+ .cse27 2147483648) 0) (< 2147483647 .cse27) (< 2147483647 .cse23))))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse37 (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse30 (select .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse31 (select .cse37 .cse10))) (let ((.cse34 (+ .cse30 .cse31))) (or (< (+ .cse30 .cse31 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse35 (select (store .cse36 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse33 (select .cse35 .cse10))) (or (< (+ .cse32 2147483648 .cse33) 0) (= .cse34 (+ .cse32 .cse33)) (< 2147483647 .cse32) (< 0 (+ .cse33 1)))))) (< (+ .cse30 2147483648) 0) (< 2147483647 .cse30) (< 2147483647 .cse34)))))))))) (and (or .cse1 (and (or .cse0 .cse4) (or .cse0 (and (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse12 .cse10)) (.cse5 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (+ .cse5 .cse6 2147483648) 0) (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse7 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse8 (select .cse9 .cse10))) (or (< (+ .cse7 2147483648 .cse8) 0) (= (+ .cse5 .cse6) (+ .cse7 .cse8)) (< 2147483647 .cse7) (< 0 (+ .cse8 1)))))) (< 0 (+ .cse6 1)) (< 2147483647 .cse5)))))) (forall ((v_ArrVal_653 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_653))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse16 (select .cse20 .cse10)) (.cse15 (select .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse18 (select (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse14 (select .cse18 .cse10))) (let ((.cse17 (+ .cse13 .cse14))) (or (< (+ .cse13 2147483648 .cse14) 0) (= (+ .cse15 .cse16) .cse17) (< (+ .cse13 2147483648) 0) (< 2147483647 .cse13) (< 2147483647 .cse17)))))) (< (+ .cse15 .cse16 2147483648) 0) (< 0 (+ .cse16 1)) (< 2147483647 .cse15)))))))))) (or .cse0 .cse1 .cse4)))) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or .cse0 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse1 (< .cse3 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse2))) is different from false [2023-01-28 09:52:43,497 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse35 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4)))) (.cse36 (* c_~j~0 4))) (let ((.cse11 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse12 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse5 (+ c_~A~0.offset .cse36)) (.cse4 (+ c_~A~0.offset .cse36 4)) (.cse6 (< (+ 2 c_~j~0) c_~N~0)) (.cse7 (<= c_~N~0 (+ c_~j~0 1))) (.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse16 (+ c_~bag1~0 .cse35))) (let ((.cse17 (< 2147483647 .cse16)) (.cse20 (< (+ c_~bag1~0 .cse35 2147483648) 0)) (.cse23 (< (+ |c_thread1Thread1of1ForFork0_#t~ret2#1| 2147483648) 0)) (.cse21 (< 2147483647 .cse2)) (.cse18 (let ((.cse27 (+ c_~bag1~0 c_~sum1~0 .cse35))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse25 (select .cse28 .cse5)) (.cse26 (select .cse28 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse25)) (= (+ c_~bag2~0 .cse25 .cse26 c_~sum2~0) .cse27) (< (+ .cse25 .cse26 2147483648) 0) (< c_~bag2~0 (+ .cse26 1)))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse29 (select .cse31 .cse5)) (.cse30 (select .cse31 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse29)) (< (+ c_~bag2~0 .cse29 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse29 c_~sum2~0)) (= (+ c_~bag2~0 .cse29 .cse30 c_~sum2~0) .cse27) (< (+ .cse29 .cse30 2147483648) 0) (< (+ c_~bag2~0 .cse29 2147483648) 0) (< 2147483647 (+ .cse29 .cse30)))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse33 (select .cse34 .cse4)) (.cse32 (select .cse34 .cse5))) (or (< 2147483647 (+ c_~bag2~0 .cse32)) (= (+ c_~bag2~0 .cse32 .cse33 c_~sum2~0) .cse27) (< (+ c_~bag2~0 .cse32 .cse33 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse32 .cse33)) (< (+ c_~bag2~0 .cse32 2147483648) 0))))) .cse6 .cse7)))) (.cse22 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0)) (.cse19 (< (+ c_~i~0 1) c_~N~0)) (.cse24 (< 2147483647 |c_thread1Thread1of1ForFork0_#t~ret2#1|))) (and (or (< c_~i~0 c_~N~0) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse0)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< (+ .cse0 .cse1 2147483648) 0) (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) .cse2))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse8)) (< (+ .cse8 .cse9 2147483648) 0) (< c_~bag2~0 (+ .cse9 1)) (= (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse2))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 .cse14 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 .cse14)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse2))))) .cse6 .cse7))) (or (and (or (<= c_~cap1~0 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse17 .cse21 .cse18 .cse22 .cse19 .cse20)) (<= c_~N~0 c_~i~0)) (or .cse23 .cse17 .cse18 (<= c_~cap1~0 |c_thread1Thread1of1ForFork0_#t~ret2#1|) .cse19 .cse20 .cse24) (or .cse23 (< |c_thread1Thread1of1ForFork0_#t~ret2#1| c_~cap1~0) .cse21 .cse18 .cse22 .cse19 .cse24))))) is different from false [2023-01-28 09:52:43,572 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse36 (* c_~j~0 4))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse11 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse12 (< 2147483647 (+ c_~bag2~0 c_~sum2~0))) (.cse5 (+ c_~A~0.offset .cse36)) (.cse4 (+ c_~A~0.offset .cse36 4)) (.cse6 (< (+ 2 c_~j~0) c_~N~0)) (.cse7 (<= c_~N~0 (+ c_~j~0 1))) (.cse32 (< 2 c_~N~0)) (.cse33 (<= c_~N~0 1)) (.cse35 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse34 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or (< c_~i~0 c_~N~0) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse0)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< (+ .cse0 .cse1 2147483648) 0) (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) .cse2))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse8)) (< (+ .cse8 .cse9 2147483648) 0) (< c_~bag2~0 (+ .cse9 1)) (= (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse2))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 .cse14 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 .cse14)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse2))))) .cse6 .cse7))) (or (let ((.cse21 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse16 (+ c_~bag1~0 .cse21))) (let ((.cse17 (< 2147483647 .cse16)) (.cse18 (let ((.cse24 (+ c_~bag1~0 c_~sum1~0 .cse21))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse22 (select .cse25 .cse5)) (.cse23 (select .cse25 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse22)) (= (+ c_~bag2~0 .cse22 .cse23 c_~sum2~0) .cse24) (< (+ .cse22 .cse23 2147483648) 0) (< c_~bag2~0 (+ .cse23 1)))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse26 (select .cse28 .cse5)) (.cse27 (select .cse28 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse26)) (< (+ c_~bag2~0 .cse26 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse26 c_~sum2~0)) (= (+ c_~bag2~0 .cse26 .cse27 c_~sum2~0) .cse24) (< (+ .cse26 .cse27 2147483648) 0) (< (+ c_~bag2~0 .cse26 2147483648) 0) (< 2147483647 (+ .cse26 .cse27)))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse4)) (.cse29 (select .cse31 .cse5))) (or (< 2147483647 (+ c_~bag2~0 .cse29)) (= (+ c_~bag2~0 .cse29 .cse30 c_~sum2~0) .cse24) (< (+ c_~bag2~0 .cse29 .cse30 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse29 .cse30)) (< (+ c_~bag2~0 .cse29 2147483648) 0))))) .cse6 .cse7)))) (.cse19 (< (+ c_~i~0 1) c_~N~0)) (.cse20 (< (+ c_~bag1~0 .cse21 2147483648) 0))) (and (or (<= c_~cap1~0 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse17 (< 2147483647 .cse2) .cse18 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19 .cse20))))) (<= c_~N~0 c_~i~0)) (or .cse32 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse33 .cse34 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse35)) (or .cse32 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse33 (< .cse35 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse34)))) is different from false [2023-01-28 09:52:43,823 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse37 (* c_~j~0 4)) (.cse36 (+ c_~bag2~0 c_~sum2~0))) (let ((.cse2 (+ c_~bag1~0 c_~sum1~0)) (.cse11 (< (+ c_~bag2~0 c_~sum2~0 2147483648) 0)) (.cse12 (< 2147483647 .cse36)) (.cse5 (+ c_~A~0.offset .cse37)) (.cse4 (+ c_~A~0.offset .cse37 4)) (.cse6 (< (+ 2 c_~j~0) c_~N~0)) (.cse7 (<= c_~N~0 (+ c_~j~0 1))) (.cse32 (< 2 c_~N~0)) (.cse33 (<= c_~N~0 1)) (.cse35 (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|)) (.cse34 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))) (and (or (< c_~i~0 c_~N~0) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse0 (select .cse3 .cse5)) (.cse1 (select .cse3 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse0)) (< (+ c_~bag2~0 .cse0 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse0 c_~sum2~0)) (< (+ .cse0 .cse1 2147483648) 0) (< (+ c_~bag2~0 .cse0 2147483648) 0) (< 2147483647 (+ .cse0 .cse1)) (= (+ c_~bag2~0 .cse0 .cse1 c_~sum2~0) .cse2))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse5)) (.cse9 (select .cse10 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse8)) (< (+ .cse8 .cse9 2147483648) 0) (< c_~bag2~0 (+ .cse9 1)) (= (+ c_~bag2~0 .cse8 .cse9 c_~sum2~0) .cse2))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse13 (select .cse15 .cse5)) (.cse14 (select .cse15 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse13)) (< (+ c_~bag2~0 .cse13 .cse14 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse13 .cse14)) (< (+ c_~bag2~0 .cse13 2147483648) 0) (= (+ c_~bag2~0 .cse13 .cse14 c_~sum2~0) .cse2))))) .cse6 .cse7))) (or (let ((.cse21 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_~i~0 4))))) (let ((.cse16 (+ c_~bag1~0 .cse21))) (let ((.cse17 (< 2147483647 .cse16)) (.cse18 (let ((.cse24 (+ c_~bag1~0 c_~sum1~0 .cse21))) (and (or (and (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse22 (select .cse25 .cse5)) (.cse23 (select .cse25 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse22)) (= (+ c_~bag2~0 .cse22 .cse23 c_~sum2~0) .cse24) (< (+ .cse22 .cse23 2147483648) 0) (< c_~bag2~0 (+ .cse23 1)))))) .cse6 .cse7) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse28 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse26 (select .cse28 .cse5)) (.cse27 (select .cse28 .cse4))) (or (< 2147483647 (+ c_~bag2~0 .cse26)) (< (+ c_~bag2~0 .cse26 c_~sum2~0 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse26 c_~sum2~0)) (= (+ c_~bag2~0 .cse26 .cse27 c_~sum2~0) .cse24) (< (+ .cse26 .cse27 2147483648) 0) (< (+ c_~bag2~0 .cse26 2147483648) 0) (< 2147483647 (+ .cse26 .cse27)))))) .cse6 .cse7)) .cse11 .cse12) (or (forall ((v_ArrVal_654 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_654) c_~A~0.base))) (let ((.cse30 (select .cse31 .cse4)) (.cse29 (select .cse31 .cse5))) (or (< 2147483647 (+ c_~bag2~0 .cse29)) (= (+ c_~bag2~0 .cse29 .cse30 c_~sum2~0) .cse24) (< (+ c_~bag2~0 .cse29 .cse30 2147483648) 0) (< 2147483647 (+ c_~bag2~0 .cse29 .cse30)) (< (+ c_~bag2~0 .cse29 2147483648) 0))))) .cse6 .cse7)))) (.cse19 (< (+ c_~i~0 1) c_~N~0)) (.cse20 (< (+ c_~bag1~0 .cse21 2147483648) 0))) (and (or (<= c_~cap1~0 .cse16) .cse17 .cse18 .cse19 .cse20) (or .cse17 (< 2147483647 .cse2) .cse18 (< (+ c_~bag1~0 c_~sum1~0 2147483648) 0) .cse19 .cse20))))) (<= c_~N~0 c_~i~0)) (or .cse32 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse33 .cse34 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| .cse35)) (<= c_~sum1~0 .cse36) (<= c_~sum1~0 2147483647) (<= .cse36 c_~sum1~0) (or .cse32 (<= |c_ULTIMATE.start_create_fresh_int_array_~size#1| |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) .cse33 (< .cse35 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse34) (= c_~sum1~0 c_~sum2~0) (<= 0 (+ c_~sum1~0 2147483648))))) is different from false [2023-01-28 09:52:59,505 WARN L222 SmtUtils]: Spent 14.96s on a formula simplification. DAG size of input: 212 DAG size of output: 211 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:53:15,578 WARN L222 SmtUtils]: Spent 10.58s on a formula simplification. DAG size of input: 200 DAG size of output: 199 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:53:26,724 WARN L222 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 215 DAG size of output: 214 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 09:53:53,352 INFO L130 PetriNetUnfolder]: 3014/5239 cut-off events. [2023-01-28 09:53:53,352 INFO L131 PetriNetUnfolder]: For 80280/80280 co-relation queries the response was YES. [2023-01-28 09:53:53,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56326 conditions, 5239 events. 3014/5239 cut-off events. For 80280/80280 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 33939 event pairs, 122 based on Foata normal form. 13/5252 useless extension candidates. Maximal degree in co-relation 56257. Up to 1504 conditions per place. [2023-01-28 09:53:53,402 INFO L137 encePairwiseOnDemand]: 747/759 looper letters, 544 selfloop transitions, 1160 changer transitions 31/1735 dead transitions. [2023-01-28 09:53:53,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 1735 transitions, 39951 flow [2023-01-28 09:53:53,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-01-28 09:53:53,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2023-01-28 09:53:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 17438 transitions. [2023-01-28 09:53:53,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3104725278638322 [2023-01-28 09:53:53,413 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 17438 transitions. [2023-01-28 09:53:53,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 17438 transitions. [2023-01-28 09:53:53,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:53:53,415 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 17438 transitions. [2023-01-28 09:53:53,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 235.64864864864865) internal successors, (17438), 74 states have internal predecessors, (17438), 0 states have call successors, (0), 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-28 09:53:53,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 759.0) internal successors, (56925), 75 states have internal predecessors, (56925), 0 states have call successors, (0), 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-28 09:53:53,459 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 759.0) internal successors, (56925), 75 states have internal predecessors, (56925), 0 states have call successors, (0), 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-28 09:53:53,460 INFO L175 Difference]: Start difference. First operand has 380 places, 1154 transitions, 25275 flow. Second operand 74 states and 17438 transitions. [2023-01-28 09:53:53,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 1735 transitions, 39951 flow [2023-01-28 09:53:54,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1735 transitions, 38400 flow, removed 420 selfloop flow, removed 29 redundant places. [2023-01-28 09:53:54,559 INFO L231 Difference]: Finished difference. Result has 425 places, 1454 transitions, 34811 flow [2023-01-28 09:53:54,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=21505, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1026, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=741, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=34811, PETRI_PLACES=425, PETRI_TRANSITIONS=1454} [2023-01-28 09:53:54,560 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 405 predicate places. [2023-01-28 09:53:54,560 INFO L495 AbstractCegarLoop]: Abstraction has has 425 places, 1454 transitions, 34811 flow [2023-01-28 09:53:54,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 232.45) internal successors, (9298), 40 states have internal predecessors, (9298), 0 states have call successors, (0), 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-28 09:53:54,562 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:53:54,562 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:53:54,569 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-28 09:53:54,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:53:54,768 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-28 09:53:54,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:53:54,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1028178930, now seen corresponding path program 18 times [2023-01-28 09:53:54,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:53:54,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150035461] [2023-01-28 09:53:54,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:53:54,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:53:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:54:00,049 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-28 09:54:00,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:54:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150035461] [2023-01-28 09:54:00,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150035461] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:54:00,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740898025] [2023-01-28 09:54:00,050 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 09:54:00,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:54:00,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:54:00,050 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-28 09:54:00,053 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-28 09:54:00,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 09:54:00,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 09:54:00,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 90 conjunts are in the unsatisfiable core [2023-01-28 09:54:00,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:54:00,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:54:00,458 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 14 treesize of output 16 [2023-01-28 09:54:01,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:54:01,417 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 234 treesize of output 154 [2023-01-28 09:54:01,537 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-28 09:54:01,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:54:10,570 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:10,571 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 1395 treesize of output 985 [2023-01-28 09:54:10,683 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:10,683 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 890 treesize of output 785 [2023-01-28 09:54:10,731 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:10,732 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 772 treesize of output 691 [2023-01-28 09:54:10,780 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:10,780 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 678 treesize of output 585 [2023-01-28 09:54:11,152 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 09:54:11,389 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,389 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 2217 treesize of output 1572 [2023-01-28 09:54:11,518 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,519 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 1528 treesize of output 1461 [2023-01-28 09:54:11,642 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,643 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 1448 treesize of output 1392 [2023-01-28 09:54:11,746 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,747 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 1379 treesize of output 1298 [2023-01-28 09:54:11,840 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,841 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 1285 treesize of output 1206 [2023-01-28 09:54:11,889 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-01-28 09:54:11,917 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,917 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 1193 treesize of output 1138 [2023-01-28 09:54:11,996 INFO L321 Elim1Store]: treesize reduction 28, result has 24.3 percent of original size [2023-01-28 09:54:11,997 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 1125 treesize of output 1032 [2023-01-28 09:54:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 09:54:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740898025] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 09:54:12,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 09:54:12,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 11] total 35 [2023-01-28 09:54:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906341448] [2023-01-28 09:54:12,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 09:54:12,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-01-28 09:54:12,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 09:54:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-01-28 09:54:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1054, Unknown=1, NotChecked=0, Total=1260 [2023-01-28 09:54:12,907 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 759 [2023-01-28 09:54:12,910 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 1454 transitions, 34811 flow. Second operand has 36 states, 36 states have (on average 232.58333333333334) internal successors, (8373), 36 states have internal predecessors, (8373), 0 states have call successors, (0), 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-28 09:54:12,910 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 09:54:12,910 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 759 [2023-01-28 09:54:12,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 09:54:41,104 INFO L130 PetriNetUnfolder]: 2830/4932 cut-off events. [2023-01-28 09:54:41,104 INFO L131 PetriNetUnfolder]: For 85011/85011 co-relation queries the response was YES. [2023-01-28 09:54:41,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55432 conditions, 4932 events. 2830/4932 cut-off events. For 85011/85011 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 31780 event pairs, 42 based on Foata normal form. 21/4953 useless extension candidates. Maximal degree in co-relation 55350. Up to 1336 conditions per place. [2023-01-28 09:54:41,145 INFO L137 encePairwiseOnDemand]: 748/759 looper letters, 315 selfloop transitions, 1150 changer transitions 27/1492 dead transitions. [2023-01-28 09:54:41,145 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 1492 transitions, 37171 flow [2023-01-28 09:54:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 09:54:41,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 09:54:41,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 11330 transitions. [2023-01-28 09:54:41,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3109903381642512 [2023-01-28 09:54:41,153 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 11330 transitions. [2023-01-28 09:54:41,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 11330 transitions. [2023-01-28 09:54:41,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 09:54:41,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 11330 transitions. [2023-01-28 09:54:41,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 236.04166666666666) internal successors, (11330), 48 states have internal predecessors, (11330), 0 states have call successors, (0), 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-28 09:54:41,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 759.0) internal successors, (37191), 49 states have internal predecessors, (37191), 0 states have call successors, (0), 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-28 09:54:41,176 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 759.0) internal successors, (37191), 49 states have internal predecessors, (37191), 0 states have call successors, (0), 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-28 09:54:41,176 INFO L175 Difference]: Start difference. First operand has 425 places, 1454 transitions, 34811 flow. Second operand 48 states and 11330 transitions. [2023-01-28 09:54:41,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 1492 transitions, 37171 flow [2023-01-28 09:54:42,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 1492 transitions, 35780 flow, removed 247 selfloop flow, removed 16 redundant places. [2023-01-28 09:54:42,184 INFO L231 Difference]: Finished difference. Result has 445 places, 1372 transitions, 34001 flow [2023-01-28 09:54:42,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=759, PETRI_DIFFERENCE_MINUEND_FLOW=31287, PETRI_DIFFERENCE_MINUEND_PLACES=391, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=34001, PETRI_PLACES=445, PETRI_TRANSITIONS=1372} [2023-01-28 09:54:42,185 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 425 predicate places. [2023-01-28 09:54:42,185 INFO L495 AbstractCegarLoop]: Abstraction has has 445 places, 1372 transitions, 34001 flow [2023-01-28 09:54:42,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 232.58333333333334) internal successors, (8373), 36 states have internal predecessors, (8373), 0 states have call successors, (0), 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-28 09:54:42,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 09:54:42,186 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 09:54:42,192 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-28 09:54:42,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:54:42,392 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-28 09:54:42,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 09:54:42,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1772881428, now seen corresponding path program 19 times [2023-01-28 09:54:42,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 09:54:42,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8092963] [2023-01-28 09:54:42,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 09:54:42,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 09:54:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:54:51,260 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-28 09:54:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 09:54:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8092963] [2023-01-28 09:54:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8092963] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 09:54:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182107845] [2023-01-28 09:54:51,261 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 09:54:51,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 09:54:51,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 09:54:51,262 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-28 09:54:51,263 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-28 09:54:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 09:54:51,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 86 conjunts are in the unsatisfiable core [2023-01-28 09:54:51,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 09:54:51,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 09:54:51,647 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 14 treesize of output 16 [2023-01-28 09:54:52,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 09:54:52,640 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 240 treesize of output 160 [2023-01-28 09:54:52,773 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-28 09:54:52,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 09:55:01,412 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,413 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 2535 treesize of output 1789 [2023-01-28 09:55:01,496 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,496 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 1751 treesize of output 1664 [2023-01-28 09:55:01,575 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,576 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 1637 treesize of output 1574 [2023-01-28 09:55:01,660 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,661 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 1547 treesize of output 1496 [2023-01-28 09:55:01,749 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,750 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 1469 treesize of output 1394 [2023-01-28 09:55:01,835 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,835 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 1367 treesize of output 1304 [2023-01-28 09:55:01,922 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:55:01,923 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 1277 treesize of output 1202 [2023-01-28 09:56:21,160 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:56:21,161 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 1390 treesize of output 998 [2023-01-28 09:56:21,288 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:56:21,289 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 897 treesize of output 834 [2023-01-28 09:56:21,370 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:56:21,370 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 807 treesize of output 720 [2023-01-28 09:56:21,447 INFO L321 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-01-28 09:56:21,447 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 693 treesize of output 618 Received shutdown request... [2023-01-28 09:56:29,226 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-01-28 09:56:29,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-01-28 09:56:29,252 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 09:56:29,264 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-28 09:56:29,432 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,SelfDestructingSolverStorable24 [2023-01-28 09:56:29,432 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-5-13-2-13-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-20-13-7-14-6-11-2-7-2-9-1 context. [2023-01-28 09:56:29,434 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-01-28 09:56:29,434 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-01-28 09:56:29,434 INFO L445 BasicCegarLoop]: Path program histogram: [19, 2, 1, 1, 1, 1] [2023-01-28 09:56:29,438 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 09:56:29,438 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 09:56:29,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:56:29 BasicIcfg [2023-01-28 09:56:29,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 09:56:29,440 INFO L158 Benchmark]: Toolchain (without parser) took 791538.97ms. Allocated memory was 348.1MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 318.6MB in the beginning and 764.5MB in the end (delta: -445.9MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-01-28 09:56:29,440 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 09:56:29,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.42ms. Allocated memory is still 348.1MB. Free memory was 318.2MB in the beginning and 306.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 09:56:29,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.11ms. Allocated memory is still 348.1MB. Free memory was 306.7MB in the beginning and 303.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 09:56:29,441 INFO L158 Benchmark]: Boogie Preprocessor took 30.52ms. Allocated memory is still 348.1MB. Free memory was 303.8MB in the beginning and 301.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 09:56:29,441 INFO L158 Benchmark]: RCFGBuilder took 642.69ms. Allocated memory is still 348.1MB. Free memory was 301.7MB in the beginning and 276.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 09:56:29,442 INFO L158 Benchmark]: TraceAbstraction took 790612.77ms. Allocated memory was 348.1MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 275.2MB in the beginning and 764.5MB in the end (delta: -489.3MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. [2023-01-28 09:56:29,443 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.10ms. Allocated memory is still 255.9MB. Free memory is still 213.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 204.42ms. Allocated memory is still 348.1MB. Free memory was 318.2MB in the beginning and 306.7MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.11ms. Allocated memory is still 348.1MB. Free memory was 306.7MB in the beginning and 303.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.52ms. Allocated memory is still 348.1MB. Free memory was 303.8MB in the beginning and 301.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 642.69ms. Allocated memory is still 348.1MB. Free memory was 301.7MB in the beginning and 276.1MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 790612.77ms. Allocated memory was 348.1MB in the beginning and 2.2GB in the end (delta: 1.9GB). Free memory was 275.2MB in the beginning and 764.5MB in the end (delta: -489.3MB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.3s, 315 PlacesBefore, 20 PlacesAfterwards, 336 TransitionsBefore, 17 TransitionsAfterwards, 25652 CoEnabledTransitionPairs, 8 FixpointIterations, 100 TrivialSequentialCompositions, 198 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 75 ConcurrentYvCompositions, 24 ChoiceCompositions, 413 TotalNumberOfCompositions, 22140 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 21832, independent: 21808, independent conditional: 0, independent unconditional: 21808, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 15314, independent: 15300, independent conditional: 0, independent unconditional: 15300, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 21832, independent: 6508, independent conditional: 0, independent unconditional: 6508, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 15314, unknown conditional: 0, unknown unconditional: 15314] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 103]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-5-13-2-13-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-20-13-7-14-6-11-2-7-2-9-1 context. - TimeoutResultAtElement [Line: 98]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-5-13-2-13-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-20-13-7-14-6-11-2-7-2-9-1 context. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 21 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-2-5-13-2-13-3-2-1 term,while PolyPacSimplificationTermWalker was simplifying 11 xjuncts wrt. a ∧-20-13-7-14-6-11-2-7-2-9-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 513 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 790.4s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 406.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.6s, HoareTripleCheckerStatistics: 115 mSolverCounterUnknown, 5965 SdHoareTripleChecker+Valid, 20.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5965 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 19.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1513 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1305 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14272 IncrementalHoareTripleChecker+Invalid, 17205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1305 mSolverCounterUnsat, 0 mSDtfsCounter, 14272 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1470 GetRequests, 383 SyntacticMatches, 14 SemanticMatches, 1073 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 26114 ImplicationChecksByTransitivity, 386.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34811occurred in iteration=23, InterpolantAutomatonStates: 774, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 259.5s InterpolantComputationTime, 728 NumberOfCodeBlocks, 728 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 997 ConstructedInterpolants, 25 QuantifiedInterpolants, 86626 SizeOfPredicates, 1119 NumberOfNonLiveVariables, 4536 ConjunctsInSsa, 979 ConjunctsInUnsatCore, 62 InterpolantComputations, 6 PerfectInterpolantSequences, 69/320 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown