/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 23:19:46,921 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 23:19:46,922 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 23:19:46,948 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 23:19:46,949 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 23:19:46,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 23:19:46,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 23:19:46,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 23:19:46,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 23:19:46,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 23:19:46,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 23:19:46,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 23:19:46,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 23:19:46,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 23:19:46,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 23:19:46,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 23:19:46,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 23:19:46,970 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 23:19:46,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 23:19:46,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 23:19:46,975 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 23:19:46,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 23:19:46,978 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 23:19:46,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 23:19:46,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 23:19:46,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 23:19:46,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 23:19:46,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 23:19:46,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 23:19:46,983 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 23:19:46,983 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 23:19:46,984 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 23:19:46,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 23:19:46,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 23:19:46,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 23:19:46,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 23:19:46,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 23:19:46,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 23:19:46,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 23:19:46,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 23:19:46,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 23:19:46,991 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 23:19:47,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 23:19:47,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 23:19:47,017 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 23:19:47,018 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 23:19:47,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 23:19:47,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 23:19:47,018 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 23:19:47,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 23:19:47,018 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 23:19:47,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 23:19:47,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 23:19:47,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:19:47,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 23:19:47,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 23:19:47,021 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 23:19:47,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 23:19:47,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-09-20 23:19:47,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 23:19:47,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 23:19:47,220 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 23:19:47,221 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 23:19:47,221 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 23:19:47,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-09-20 23:19:47,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735daeae3/f6f8b3f8e8624679b91c45889623a4f5/FLAG80748af9f [2022-09-20 23:19:47,654 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 23:19:47,654 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2022-09-20 23:19:47,660 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735daeae3/f6f8b3f8e8624679b91c45889623a4f5/FLAG80748af9f [2022-09-20 23:19:47,671 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/735daeae3/f6f8b3f8e8624679b91c45889623a4f5 [2022-09-20 23:19:47,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 23:19:47,674 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 23:19:47,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 23:19:47,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 23:19:47,678 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 23:19:47,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,679 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2322bee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47, skipping insertion in model container [2022-09-20 23:19:47,679 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,684 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 23:19:47,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 23:19:47,877 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-09-20 23:19:47,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:19:47,896 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 23:19:47,924 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-09-20 23:19:47,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 23:19:47,937 INFO L208 MainTranslator]: Completed translation [2022-09-20 23:19:47,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47 WrapperNode [2022-09-20 23:19:47,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 23:19:47,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 23:19:47,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 23:19:47,940 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 23:19:47,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,958 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,979 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2022-09-20 23:19:47,979 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 23:19:47,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 23:19:47,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 23:19:47,980 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 23:19:47,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,999 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:47,999 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:48,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:48,005 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:48,006 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:48,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 23:19:48,008 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 23:19:48,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 23:19:48,009 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 23:19:48,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (1/1) ... [2022-09-20 23:19:48,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 23:19:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:19:48,034 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 23:19:48,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 23:19:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 23:19:48,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-20 23:19:48,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-20 23:19:48,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-20 23:19:48,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-20 23:19:48,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-20 23:19:48,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-20 23:19:48,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 23:19:48,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 23:19:48,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 23:19:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 23:19:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 23:19:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-20 23:19:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 23:19:48,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 23:19:48,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-20 23:19:48,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 23:19:48,074 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 23:19:48,180 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 23:19:48,181 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 23:19:48,436 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 23:19:48,489 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 23:19:48,489 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-20 23:19:48,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:19:48 BoogieIcfgContainer [2022-09-20 23:19:48,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 23:19:48,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 23:19:48,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 23:19:48,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 23:19:48,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 11:19:47" (1/3) ... [2022-09-20 23:19:48,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e68acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:19:48, skipping insertion in model container [2022-09-20 23:19:48,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 11:19:47" (2/3) ... [2022-09-20 23:19:48,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39e68acf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 11:19:48, skipping insertion in model container [2022-09-20 23:19:48,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 11:19:48" (3/3) ... [2022-09-20 23:19:48,496 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-09-20 23:19:48,507 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 23:19:48,507 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-09-20 23:19:48,507 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 23:19:48,542 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-09-20 23:19:48,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 159 transitions, 342 flow [2022-09-20 23:19:48,614 INFO L130 PetriNetUnfolder]: 13/156 cut-off events. [2022-09-20 23:19:48,614 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:19:48,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 156 events. 13/156 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 98 event pairs, 0 based on Foata normal form. 0/142 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-09-20 23:19:48,619 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 159 transitions, 342 flow [2022-09-20 23:19:48,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 145 transitions, 308 flow [2022-09-20 23:19:48,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 23:19:48,632 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;@634ab1a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 23:19:48,633 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-09-20 23:19:48,673 INFO L130 PetriNetUnfolder]: 13/144 cut-off events. [2022-09-20 23:19:48,673 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-09-20 23:19:48,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:48,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:48,674 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:48,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:48,678 INFO L85 PathProgramCache]: Analyzing trace with hash 840975013, now seen corresponding path program 1 times [2022-09-20 23:19:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:48,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214833845] [2022-09-20 23:19:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:48,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:48,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:48,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214833845] [2022-09-20 23:19:48,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214833845] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:19:48,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:19:48,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 23:19:48,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852868832] [2022-09-20 23:19:48,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:48,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-20 23:19:48,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:48,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-20 23:19:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-20 23:19:48,913 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 159 [2022-09-20 23:19:48,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 145 transitions, 308 flow. Second operand has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:48,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:48,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 159 [2022-09-20 23:19:48,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:49,049 INFO L130 PetriNetUnfolder]: 42/270 cut-off events. [2022-09-20 23:19:49,049 INFO L131 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-09-20 23:19:49,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361 conditions, 270 events. 42/270 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 717 event pairs, 15 based on Foata normal form. 42/281 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-09-20 23:19:49,052 INFO L137 encePairwiseOnDemand]: 151/159 looper letters, 9 selfloop transitions, 0 changer transitions 4/137 dead transitions. [2022-09-20 23:19:49,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 137 transitions, 310 flow [2022-09-20 23:19:49,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-20 23:19:49,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-09-20 23:19:49,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 299 transitions. [2022-09-20 23:19:49,070 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.940251572327044 [2022-09-20 23:19:49,071 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 299 transitions. [2022-09-20 23:19:49,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 299 transitions. [2022-09-20 23:19:49,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:49,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 299 transitions. [2022-09-20 23:19:49,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.5) internal successors, (299), 2 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,085 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,087 INFO L175 Difference]: Start difference. First operand has 142 places, 145 transitions, 308 flow. Second operand 2 states and 299 transitions. [2022-09-20 23:19:49,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 137 transitions, 310 flow [2022-09-20 23:19:49,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 298 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-09-20 23:19:49,094 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 272 flow [2022-09-20 23:19:49,095 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=280, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=272, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2022-09-20 23:19:49,098 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-09-20 23:19:49,098 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 272 flow [2022-09-20 23:19:49,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 145.0) internal successors, (290), 2 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:49,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:49,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 23:19:49,100 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:49,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:49,101 INFO L85 PathProgramCache]: Analyzing trace with hash 467383893, now seen corresponding path program 1 times [2022-09-20 23:19:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:49,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830135836] [2022-09-20 23:19:49,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:49,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:49,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:49,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830135836] [2022-09-20 23:19:49,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830135836] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:19:49,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:19:49,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-09-20 23:19:49,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314765479] [2022-09-20 23:19:49,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:49,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-20 23:19:49,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:49,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-20 23:19:49,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-09-20 23:19:49,279 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 159 [2022-09-20 23:19:49,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:49,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 159 [2022-09-20 23:19:49,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:49,364 INFO L130 PetriNetUnfolder]: 47/304 cut-off events. [2022-09-20 23:19:49,365 INFO L131 PetriNetUnfolder]: For 16/17 co-relation queries the response was YES. [2022-09-20 23:19:49,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 304 events. 47/304 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 843 event pairs, 4 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 389. Up to 43 conditions per place. [2022-09-20 23:19:49,367 INFO L137 encePairwiseOnDemand]: 154/159 looper letters, 29 selfloop transitions, 5 changer transitions 0/152 dead transitions. [2022-09-20 23:19:49,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 152 transitions, 385 flow [2022-09-20 23:19:49,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-20 23:19:49,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-09-20 23:19:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2022-09-20 23:19:49,374 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9040880503144654 [2022-09-20 23:19:49,375 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 575 transitions. [2022-09-20 23:19:49,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 575 transitions. [2022-09-20 23:19:49,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:49,375 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 575 transitions. [2022-09-20 23:19:49,376 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.75) internal successors, (575), 4 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,378 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,378 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 272 flow. Second operand 4 states and 575 transitions. [2022-09-20 23:19:49,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 152 transitions, 385 flow [2022-09-20 23:19:49,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 152 transitions, 385 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 23:19:49,381 INFO L231 Difference]: Finished difference. Result has 137 places, 136 transitions, 297 flow [2022-09-20 23:19:49,381 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=137, PETRI_TRANSITIONS=136} [2022-09-20 23:19:49,382 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, -5 predicate places. [2022-09-20 23:19:49,382 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 136 transitions, 297 flow [2022-09-20 23:19:49,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,383 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:49,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:49,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 23:19:49,385 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash 191455911, now seen corresponding path program 1 times [2022-09-20 23:19:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:49,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679173596] [2022-09-20 23:19:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:49,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:49,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:49,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:49,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679173596] [2022-09-20 23:19:49,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679173596] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:19:49,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 23:19:49,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 23:19:49,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97817396] [2022-09-20 23:19:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 23:19:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:49,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 23:19:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-09-20 23:19:49,654 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 159 [2022-09-20 23:19:49,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 136 transitions, 297 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:49,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 159 [2022-09-20 23:19:49,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:49,858 INFO L130 PetriNetUnfolder]: 470/1091 cut-off events. [2022-09-20 23:19:49,858 INFO L131 PetriNetUnfolder]: For 99/99 co-relation queries the response was YES. [2022-09-20 23:19:49,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 1091 events. 470/1091 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5928 event pairs, 306 based on Foata normal form. 1/848 useless extension candidates. Maximal degree in co-relation 1999. Up to 705 conditions per place. [2022-09-20 23:19:49,869 INFO L137 encePairwiseOnDemand]: 149/159 looper letters, 47 selfloop transitions, 6 changer transitions 4/144 dead transitions. [2022-09-20 23:19:49,869 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 144 transitions, 427 flow [2022-09-20 23:19:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 23:19:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 23:19:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 855 transitions. [2022-09-20 23:19:49,872 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.6721698113207547 [2022-09-20 23:19:49,872 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 855 transitions. [2022-09-20 23:19:49,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 855 transitions. [2022-09-20 23:19:49,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:49,872 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 855 transitions. [2022-09-20 23:19:49,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.875) internal successors, (855), 8 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,878 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,878 INFO L175 Difference]: Start difference. First operand has 137 places, 136 transitions, 297 flow. Second operand 8 states and 855 transitions. [2022-09-20 23:19:49,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 144 transitions, 427 flow [2022-09-20 23:19:49,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 144 transitions, 427 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-09-20 23:19:49,883 INFO L231 Difference]: Finished difference. Result has 148 places, 137 transitions, 325 flow [2022-09-20 23:19:49,883 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=325, PETRI_PLACES=148, PETRI_TRANSITIONS=137} [2022-09-20 23:19:49,885 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2022-09-20 23:19:49,885 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 137 transitions, 325 flow [2022-09-20 23:19:49,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:49,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:49,886 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:49,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 23:19:49,886 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:49,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:49,887 INFO L85 PathProgramCache]: Analyzing trace with hash -436927170, now seen corresponding path program 1 times [2022-09-20 23:19:49,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:49,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811184312] [2022-09-20 23:19:49,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:49,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:49,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:50,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:50,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811184312] [2022-09-20 23:19:50,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811184312] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:50,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461472067] [2022-09-20 23:19:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:50,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:50,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:19:50,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:19:50,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-09-20 23:19:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:50,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 6 conjunts are in the unsatisfiable core [2022-09-20 23:19:50,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:19:50,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:50,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:19:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:50,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461472067] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:50,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:19:50,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-09-20 23:19:50,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078159025] [2022-09-20 23:19:50,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:50,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 23:19:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 23:19:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:19:50,415 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 159 [2022-09-20 23:19:50,416 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 137 transitions, 325 flow. Second operand has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:50,416 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:50,416 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 159 [2022-09-20 23:19:50,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:50,554 INFO L130 PetriNetUnfolder]: 218/630 cut-off events. [2022-09-20 23:19:50,554 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-09-20 23:19:50,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 630 events. 218/630 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2681 event pairs, 52 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 1178. Up to 170 conditions per place. [2022-09-20 23:19:50,558 INFO L137 encePairwiseOnDemand]: 151/159 looper letters, 39 selfloop transitions, 7 changer transitions 0/148 dead transitions. [2022-09-20 23:19:50,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 148 transitions, 453 flow [2022-09-20 23:19:50,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 23:19:50,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 23:19:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 873 transitions. [2022-09-20 23:19:50,561 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.784366576819407 [2022-09-20 23:19:50,561 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 873 transitions. [2022-09-20 23:19:50,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 873 transitions. [2022-09-20 23:19:50,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:50,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 873 transitions. [2022-09-20 23:19:50,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.71428571428571) internal successors, (873), 7 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:50,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:50,572 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 159.0) internal successors, (1272), 8 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:50,572 INFO L175 Difference]: Start difference. First operand has 148 places, 137 transitions, 325 flow. Second operand 7 states and 873 transitions. [2022-09-20 23:19:50,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 148 transitions, 453 flow [2022-09-20 23:19:50,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 148 transitions, 435 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-09-20 23:19:50,577 INFO L231 Difference]: Finished difference. Result has 148 places, 139 transitions, 340 flow [2022-09-20 23:19:50,577 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=148, PETRI_TRANSITIONS=139} [2022-09-20 23:19:50,578 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 6 predicate places. [2022-09-20 23:19:50,578 INFO L495 AbstractCegarLoop]: Abstraction has has 148 places, 139 transitions, 340 flow [2022-09-20 23:19:50,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:50,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:50,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:50,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-09-20 23:19:50,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:50,796 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:50,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:50,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1592164955, now seen corresponding path program 1 times [2022-09-20 23:19:50,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:50,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479587136] [2022-09-20 23:19:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:50,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:50,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:50,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:19:50,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:50,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479587136] [2022-09-20 23:19:50,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479587136] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:50,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407646621] [2022-09-20 23:19:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:50,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:50,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:19:50,923 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:19:50,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-09-20 23:19:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:51,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2022-09-20 23:19:51,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:19:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:19:51,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:19:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:19:51,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407646621] provided 1 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:51,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-09-20 23:19:51,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-09-20 23:19:51,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609494136] [2022-09-20 23:19:51,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:51,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 23:19:51,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:51,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 23:19:51,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-09-20 23:19:51,258 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2022-09-20 23:19:51,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 139 transitions, 340 flow. Second operand has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:51,261 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:51,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2022-09-20 23:19:51,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:51,554 INFO L130 PetriNetUnfolder]: 863/1809 cut-off events. [2022-09-20 23:19:51,554 INFO L131 PetriNetUnfolder]: For 618/865 co-relation queries the response was YES. [2022-09-20 23:19:51,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3763 conditions, 1809 events. 863/1809 cut-off events. For 618/865 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10582 event pairs, 157 based on Foata normal form. 247/1833 useless extension candidates. Maximal degree in co-relation 3753. Up to 365 conditions per place. [2022-09-20 23:19:51,564 INFO L137 encePairwiseOnDemand]: 147/159 looper letters, 81 selfloop transitions, 19 changer transitions 0/195 dead transitions. [2022-09-20 23:19:51,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 195 transitions, 718 flow [2022-09-20 23:19:51,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 23:19:51,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 23:19:51,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1319 transitions. [2022-09-20 23:19:51,567 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7541452258433391 [2022-09-20 23:19:51,567 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1319 transitions. [2022-09-20 23:19:51,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1319 transitions. [2022-09-20 23:19:51,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:51,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1319 transitions. [2022-09-20 23:19:51,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.9090909090909) internal successors, (1319), 11 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:51,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:51,572 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 159.0) internal successors, (1908), 12 states have internal predecessors, (1908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:51,572 INFO L175 Difference]: Start difference. First operand has 148 places, 139 transitions, 340 flow. Second operand 11 states and 1319 transitions. [2022-09-20 23:19:51,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 195 transitions, 718 flow [2022-09-20 23:19:51,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 195 transitions, 705 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 23:19:51,576 INFO L231 Difference]: Finished difference. Result has 160 places, 151 transitions, 439 flow [2022-09-20 23:19:51,576 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=439, PETRI_PLACES=160, PETRI_TRANSITIONS=151} [2022-09-20 23:19:51,576 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 18 predicate places. [2022-09-20 23:19:51,577 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 151 transitions, 439 flow [2022-09-20 23:19:51,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.33333333333333) internal successors, (1038), 9 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:51,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:51,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:51,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-09-20 23:19:51,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:51,792 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:51,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:51,792 INFO L85 PathProgramCache]: Analyzing trace with hash 809042173, now seen corresponding path program 2 times [2022-09-20 23:19:51,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:51,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202675652] [2022-09-20 23:19:51,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:51,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:19:51,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202675652] [2022-09-20 23:19:51,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202675652] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:51,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717657752] [2022-09-20 23:19:51,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:19:51,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:51,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:19:51,869 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:19:51,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-09-20 23:19:51,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-09-20 23:19:51,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:19:51,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjunts are in the unsatisfiable core [2022-09-20 23:19:51,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:19:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-09-20 23:19:52,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-20 23:19:52,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717657752] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 23:19:52,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-20 23:19:52,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-09-20 23:19:52,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264952141] [2022-09-20 23:19:52,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 23:19:52,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 23:19:52,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:52,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 23:19:52,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-09-20 23:19:52,107 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 159 [2022-09-20 23:19:52,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 151 transitions, 439 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:52,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:52,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 159 [2022-09-20 23:19:52,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:19:52,358 INFO L130 PetriNetUnfolder]: 565/1218 cut-off events. [2022-09-20 23:19:52,358 INFO L131 PetriNetUnfolder]: For 1121/1283 co-relation queries the response was YES. [2022-09-20 23:19:52,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3169 conditions, 1218 events. 565/1218 cut-off events. For 1121/1283 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6379 event pairs, 165 based on Foata normal form. 199/1395 useless extension candidates. Maximal degree in co-relation 3153. Up to 500 conditions per place. [2022-09-20 23:19:52,366 INFO L137 encePairwiseOnDemand]: 150/159 looper letters, 47 selfloop transitions, 11 changer transitions 0/155 dead transitions. [2022-09-20 23:19:52,367 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 155 transitions, 559 flow [2022-09-20 23:19:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-09-20 23:19:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-09-20 23:19:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 905 transitions. [2022-09-20 23:19:52,371 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7114779874213837 [2022-09-20 23:19:52,371 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 905 transitions. [2022-09-20 23:19:52,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 905 transitions. [2022-09-20 23:19:52,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:19:52,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 905 transitions. [2022-09-20 23:19:52,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.125) internal successors, (905), 8 states have internal predecessors, (905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:52,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:52,375 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 159.0) internal successors, (1431), 9 states have internal predecessors, (1431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:52,375 INFO L175 Difference]: Start difference. First operand has 160 places, 151 transitions, 439 flow. Second operand 8 states and 905 transitions. [2022-09-20 23:19:52,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 155 transitions, 559 flow [2022-09-20 23:19:52,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 155 transitions, 544 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-09-20 23:19:52,382 INFO L231 Difference]: Finished difference. Result has 159 places, 145 transitions, 414 flow [2022-09-20 23:19:52,382 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=414, PETRI_PLACES=159, PETRI_TRANSITIONS=145} [2022-09-20 23:19:52,383 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 17 predicate places. [2022-09-20 23:19:52,384 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 145 transitions, 414 flow [2022-09-20 23:19:52,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:52,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:19:52,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:19:52,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-09-20 23:19:52,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:52,600 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:19:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:19:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash -893650974, now seen corresponding path program 1 times [2022-09-20 23:19:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:19:52,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774242991] [2022-09-20 23:19:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:19:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:53,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:19:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774242991] [2022-09-20 23:19:53,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774242991] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:19:53,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1565784116] [2022-09-20 23:19:53,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:19:53,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:19:53,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:19:53,362 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:19:53,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-09-20 23:19:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:19:53,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 40 conjunts are in the unsatisfiable core [2022-09-20 23:19:53,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:19:54,248 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:19:54,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 69 treesize of output 45 [2022-09-20 23:19:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:54,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:19:55,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:19:55,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 105 [2022-09-20 23:19:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:19:56,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1565784116] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:19:56,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:19:56,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22, 23] total 60 [2022-09-20 23:19:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670814325] [2022-09-20 23:19:56,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:19:56,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-09-20 23:19:56,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:19:56,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-09-20 23:19:56,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=2904, Unknown=0, NotChecked=0, Total=3540 [2022-09-20 23:19:56,368 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 159 [2022-09-20 23:19:56,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 145 transitions, 414 flow. Second operand has 60 states, 60 states have (on average 68.33333333333333) internal successors, (4100), 60 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:19:56,372 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:19:56,372 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 159 [2022-09-20 23:19:56,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:20:04,813 INFO L130 PetriNetUnfolder]: 11729/19346 cut-off events. [2022-09-20 23:20:04,813 INFO L131 PetriNetUnfolder]: For 17334/17334 co-relation queries the response was YES. [2022-09-20 23:20:04,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52156 conditions, 19346 events. 11729/19346 cut-off events. For 17334/17334 co-relation queries the response was YES. Maximal size of possible extension queue 1008. Compared 148984 event pairs, 791 based on Foata normal form. 4/19271 useless extension candidates. Maximal degree in co-relation 52142. Up to 4752 conditions per place. [2022-09-20 23:20:04,958 INFO L137 encePairwiseOnDemand]: 114/159 looper letters, 738 selfloop transitions, 314 changer transitions 19/1123 dead transitions. [2022-09-20 23:20:04,959 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 1123 transitions, 6270 flow [2022-09-20 23:20:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-09-20 23:20:04,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2022-09-20 23:20:04,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 8802 transitions. [2022-09-20 23:20:04,974 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.46132075471698114 [2022-09-20 23:20:04,974 INFO L72 ComplementDD]: Start complementDD. Operand 120 states and 8802 transitions. [2022-09-20 23:20:04,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 120 states and 8802 transitions. [2022-09-20 23:20:04,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:20:04,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 120 states and 8802 transitions. [2022-09-20 23:20:04,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 121 states, 120 states have (on average 73.35) internal successors, (8802), 120 states have internal predecessors, (8802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:05,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 121 states, 121 states have (on average 159.0) internal successors, (19239), 121 states have internal predecessors, (19239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:05,091 INFO L81 ComplementDD]: Finished complementDD. Result has 121 states, 121 states have (on average 159.0) internal successors, (19239), 121 states have internal predecessors, (19239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:05,091 INFO L175 Difference]: Start difference. First operand has 159 places, 145 transitions, 414 flow. Second operand 120 states and 8802 transitions. [2022-09-20 23:20:05,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 1123 transitions, 6270 flow [2022-09-20 23:20:05,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 1123 transitions, 6161 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-09-20 23:20:05,197 INFO L231 Difference]: Finished difference. Result has 352 places, 462 transitions, 3175 flow [2022-09-20 23:20:05,198 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=120, PETRI_FLOW=3175, PETRI_PLACES=352, PETRI_TRANSITIONS=462} [2022-09-20 23:20:05,198 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 210 predicate places. [2022-09-20 23:20:05,199 INFO L495 AbstractCegarLoop]: Abstraction has has 352 places, 462 transitions, 3175 flow [2022-09-20 23:20:05,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 68.33333333333333) internal successors, (4100), 60 states have internal predecessors, (4100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:05,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:20:05,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:20:05,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-09-20 23:20:05,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:05,416 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:20:05,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:20:05,416 INFO L85 PathProgramCache]: Analyzing trace with hash -662063118, now seen corresponding path program 1 times [2022-09-20 23:20:05,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:20:05,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202843700] [2022-09-20 23:20:05,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:20:05,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:20:05,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:20:06,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:20:06,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:20:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202843700] [2022-09-20 23:20:06,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202843700] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:20:06,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887132469] [2022-09-20 23:20:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:20:06,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:06,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:20:06,004 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:20:06,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-09-20 23:20:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:20:06,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 68 conjunts are in the unsatisfiable core [2022-09-20 23:20:06,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:20:06,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 [2022-09-20 23:20:06,146 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-20 23:20:06,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 14 [2022-09-20 23:20:06,200 INFO L356 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-09-20 23:20:06,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-09-20 23:20:06,658 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-09-20 23:20:06,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 34 [2022-09-20 23:20:06,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-20 23:20:07,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:20:07,536 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:20:07,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:07,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-09-20 23:20:08,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:08,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 43 [2022-09-20 23:20:08,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:08,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:20:09,144 WARN L833 $PredicateComparison]: unable to prove that (and (or (not (< c_~max2~0 c_~max3~0)) (= c_~max1~0 c_~max3~0) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~max1~0 .cse0) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse0)) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0))))) is different from false [2022-09-20 23:20:12,017 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse2 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse2)) (= .cse2 c_~max3~0) (< (+ ~M~0 1) c_~N~0)))))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)) (< c_~max3~0 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_209 (Array Int Int))) (or (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse4 c_~max1~0) (not (< c_~max2~0 .cse4)) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse4)) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_209 (Array Int Int))) (or (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse5)) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse5)) (= .cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))) (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~A~0.base) c_~A~0.offset))))))) is different from false [2022-09-20 23:20:12,363 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse1)) (not (< ~M~0 c_~N~0)) (= .cse1 c_~max3~0) (< c_~max3~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse3)) (= c_~max1~0 .cse3) (not (< c_~max2~0 .cse3)) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) c_~A~0.base) c_~A~0.offset))) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse5) (not (< ~M~0 c_~N~0)) (not (< c_~max3~0 .cse5)) (not (< c_~max2~0 .cse5)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< (+ ~M~0 1) c_~N~0))))))) is different from false [2022-09-20 23:20:12,979 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse1)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (= .cse1 c_~max3~0) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (= (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) .cse3) (not (< c_~max3~0 .cse3)) (not (< ~M~0 c_~N~0)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max2~0 .cse6)) (not (< c_~max3~0 .cse6)) (not (< ~M~0 c_~N~0)) (= c_~max1~0 .cse6) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-09-20 23:20:13,123 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse1 c_~max3~0) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse1)) (< (+ ~M~0 1) c_~N~0)))))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse3 c_~max1~0) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse3)) (not (< c_~max3~0 .cse3)) (< (+ ~M~0 1) c_~N~0)))) (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< c_~max1~0 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse5)) (= .cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< c_~max3~0 .cse5)) (< (+ ~M~0 1) c_~N~0))))))))) is different from false [2022-09-20 23:20:13,191 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse0)) (= .cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse0)) (< (+ ~M~0 1) c_~N~0))))))) (or .cse2 (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse3)) (not (< ~M~0 c_~N~0)) (< c_~max3~0 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse3 c_~max3~0) (< (+ ~M~0 1) c_~N~0)))))) (or .cse2 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_209 (Array Int Int)) (~M~0 Int) (v_ArrVal_208 (Array Int Int)) (v_ArrVal_210 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209))) (or (not (< ~M~0 c_~N~0)) (< c_~max1~0 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max3~0 (select (select (store .cse5 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< (+ ~M~0 1) c_~N~0))))) (forall ((v_ArrVal_209 (Array Int Int)) (v_ArrVal_208 (Array Int Int))) (or (< c_~max1~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((~M~0 Int) (v_ArrVal_210 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_208) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_209) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_210) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse6)) (not (< ~M~0 c_~N~0)) (not (< c_~max2~0 .cse6)) (= c_~max1~0 .cse6) (< (+ ~M~0 1) c_~N~0)))))))) is different from false [2022-09-20 23:20:14,025 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:14,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 124 treesize of output 88 [2022-09-20 23:20:14,037 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:14,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 977 treesize of output 937 [2022-09-20 23:20:14,052 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:14,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 925 treesize of output 861 [2022-09-20 23:20:14,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 806 treesize of output 662 [2022-09-20 23:20:14,087 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:14,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 585 treesize of output 559 [2022-09-20 23:20:15,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:15,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 58 treesize of output 46 [2022-09-20 23:20:15,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:20:15,426 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:15,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 119 treesize of output 111 [2022-09-20 23:20:15,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:15,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-09-20 23:20:15,442 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:15,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 99 treesize of output 87 [2022-09-20 23:20:15,491 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-20 23:20:15,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 147 treesize of output 1 [2022-09-20 23:20:15,500 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-20 23:20:15,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 84 treesize of output 1 [2022-09-20 23:20:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-20 23:20:21,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887132469] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:20:21,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:20:21,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 34, 35] total 83 [2022-09-20 23:20:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503181598] [2022-09-20 23:20:21,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:20:21,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-09-20 23:20:21,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:20:21,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-09-20 23:20:21,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5020, Unknown=18, NotChecked=930, Total=6806 [2022-09-20 23:20:21,224 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 159 [2022-09-20 23:20:21,228 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 462 transitions, 3175 flow. Second operand has 83 states, 83 states have (on average 54.602409638554214) internal successors, (4532), 83 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:21,228 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:20:21,228 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 159 [2022-09-20 23:20:21,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:20:37,991 INFO L130 PetriNetUnfolder]: 21198/34911 cut-off events. [2022-09-20 23:20:37,991 INFO L131 PetriNetUnfolder]: For 557197/557926 co-relation queries the response was YES. [2022-09-20 23:20:38,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193790 conditions, 34911 events. 21198/34911 cut-off events. For 557197/557926 co-relation queries the response was YES. Maximal size of possible extension queue 1906. Compared 295284 event pairs, 1641 based on Foata normal form. 37/34727 useless extension candidates. Maximal degree in co-relation 193698. Up to 9302 conditions per place. [2022-09-20 23:20:39,246 INFO L137 encePairwiseOnDemand]: 113/159 looper letters, 904 selfloop transitions, 480 changer transitions 25/1454 dead transitions. [2022-09-20 23:20:39,247 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 1454 transitions, 15002 flow [2022-09-20 23:20:39,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-09-20 23:20:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2022-09-20 23:20:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 5889 transitions. [2022-09-20 23:20:39,261 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.38580974842767296 [2022-09-20 23:20:39,261 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 5889 transitions. [2022-09-20 23:20:39,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 5889 transitions. [2022-09-20 23:20:39,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:20:39,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 5889 transitions. [2022-09-20 23:20:39,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 61.34375) internal successors, (5889), 96 states have internal predecessors, (5889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:39,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 159.0) internal successors, (15423), 97 states have internal predecessors, (15423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:39,299 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 159.0) internal successors, (15423), 97 states have internal predecessors, (15423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:39,299 INFO L175 Difference]: Start difference. First operand has 352 places, 462 transitions, 3175 flow. Second operand 96 states and 5889 transitions. [2022-09-20 23:20:39,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 1454 transitions, 15002 flow [2022-09-20 23:20:45,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 1454 transitions, 14586 flow, removed 188 selfloop flow, removed 27 redundant places. [2022-09-20 23:20:45,973 INFO L231 Difference]: Finished difference. Result has 456 places, 746 transitions, 7580 flow [2022-09-20 23:20:45,974 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=2995, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=219, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=7580, PETRI_PLACES=456, PETRI_TRANSITIONS=746} [2022-09-20 23:20:45,974 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 314 predicate places. [2022-09-20 23:20:45,974 INFO L495 AbstractCegarLoop]: Abstraction has has 456 places, 746 transitions, 7580 flow [2022-09-20 23:20:45,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 54.602409638554214) internal successors, (4532), 83 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:45,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:20:45,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:20:45,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-20 23:20:46,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:46,176 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:20:46,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:20:46,177 INFO L85 PathProgramCache]: Analyzing trace with hash 564619440, now seen corresponding path program 2 times [2022-09-20 23:20:46,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:20:46,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376144058] [2022-09-20 23:20:46,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:20:46,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:20:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:20:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:47,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:20:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376144058] [2022-09-20 23:20:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376144058] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:20:47,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280991009] [2022-09-20 23:20:47,073 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:20:47,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:20:47,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:20:47,075 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:20:47,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-09-20 23:20:47,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:20:47,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:20:47,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 58 conjunts are in the unsatisfiable core [2022-09-20 23:20:47,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:20:47,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 [2022-09-20 23:20:47,248 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-20 23:20:47,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-09-20 23:20:47,296 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-20 23:20:47,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 22 [2022-09-20 23:20:47,610 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-20 23:20:47,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 18 treesize of output 18 [2022-09-20 23:20:47,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-09-20 23:20:48,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-20 23:20:48,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:48,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-09-20 23:20:48,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:48,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 27 treesize of output 27 [2022-09-20 23:20:49,197 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-20 23:20:49,197 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 61 treesize of output 32 [2022-09-20 23:20:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:20:49,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:20:50,926 WARN L833 $PredicateComparison]: unable to prove that (or (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (let ((.cse2 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((v_ArrVal_248 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)) (not (< c_~max2~0 .cse0)) (not (< c_~max3~0 .cse0)))))))) (or .cse2 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (or (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_248 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse4) (not (< c_~max2~0 .cse4)) (not (< c_~max3~0 .cse4))))))) (or .cse2 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse6 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))) (not (< c_~max1~0 .cse6)) (= c_~max3~0 .cse6))))))))) is different from false [2022-09-20 23:20:50,984 WARN L833 $PredicateComparison]: unable to prove that (or (< 1 c_~N~0) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (let ((.cse2 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((v_ArrVal_248 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)) (not (< c_~max2~0 .cse0)) (not (< c_~max3~0 .cse0)))))))) (or .cse2 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (or (< c_~max3~0 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))) (< c_~max1~0 (select (select .cse3 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_248 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse4 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (= c_~max1~0 .cse4) (not (< c_~max2~0 .cse4)) (not (< c_~max3~0 .cse4))))))) (or .cse2 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse6 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0)))) (not (< c_~max1~0 .cse6)) (= c_~max3~0 .cse6))))))))) is different from false [2022-09-20 23:20:51,120 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (not (< c_~max2~0 c_~max3~0)))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_248 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) c_~A~0.base) c_~A~0.offset))) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse0 (select (select .cse1 c_~A~0.base) c_~A~0.offset)) (not (< c_~max2~0 .cse0)) (not (< c_~max3~0 .cse0)))))))) (< ~M~0 0))) (or .cse2 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse3 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (< 0 ~M~0) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (= c_~max3~0 .cse3)))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_248 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse5)) (not (< c_~max3~0 .cse5)) (= c_~max1~0 .cse5)))))))) (or .cse2 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (or (< 0 ~M~0) (< c_~max1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))))))) is different from false [2022-09-20 23:20:51,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< c_~max1~0 .cse1)) (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< ~M~0 0) (= .cse1 c_~max3~0)))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_248 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (not (< c_~max3~0 .cse3)) (= .cse3 c_~max1~0)))))) (< ~M~0 0))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_248 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (not (< c_~max2~0 .cse4)) (not (< c_~max3~0 .cse4)) (= .cse4 (select (select .cse5 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)))))) (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))))) (< 0 ~M~0) (< ~M~0 0))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (or (< 0 ~M~0) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< c_~max1~0 (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< ~M~0 0))))))) is different from false [2022-09-20 23:20:51,457 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse2)) (< 0 ~M~0) (< ~M~0 0) (= .cse2 c_~max3~0)))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (forall ((v_ArrVal_248 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max2~0 .cse3)) (not (< c_~max3~0 .cse3)) (= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) .cse3))))))) (< ~M~0 0))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_248 (Array Int Int))) (or (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (not (< c_~max2~0 .cse5)) (not (< c_~max3~0 .cse5)) (= c_~max1~0 .cse5)))) (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))) (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (or (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))))))) is different from false [2022-09-20 23:20:51,519 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (< c_~max2~0 c_~max3~0)))) (and (or .cse0 (= c_~max1~0 c_~max3~0) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (or (< c_~max1~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< 0 ~M~0) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_248 (Array Int Int))) (or (not (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse2 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max2~0 .cse2)) (= .cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (not (< c_~max3~0 .cse2)))))))))) (or .cse0 (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~M~0 Int) (v_ArrVal_250 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse4)) (< 0 ~M~0) (= .cse4 c_~max3~0) (< ~M~0 0) (< c_~max3~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))))) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_248 (Array Int Int))) (or (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_250 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_250) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max2~0 .cse6)) (not (< c_~max3~0 .cse6)) (= .cse6 c_~max1~0)))))))))) is different from false [2022-09-20 23:20:51,828 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:51,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 43 [2022-09-20 23:20:51,836 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:51,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 303 [2022-09-20 23:20:51,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 282 treesize of output 234 [2022-09-20 23:20:51,848 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 129 treesize of output 105 [2022-09-20 23:20:51,858 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:51,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 219 treesize of output 209 [2022-09-20 23:20:51,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:51,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 54 [2022-09-20 23:20:52,012 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:52,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 651 treesize of output 615 [2022-09-20 23:20:52,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 574 treesize of output 478 [2022-09-20 23:20:52,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:20:52,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 269 treesize of output 241 [2022-09-20 23:20:52,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 454 treesize of output 406 [2022-09-20 23:20:54,047 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:20:54,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 85 [2022-09-20 23:20:54,058 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:54,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 469 treesize of output 445 [2022-09-20 23:20:54,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 424 treesize of output 352 [2022-09-20 23:20:54,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 352 treesize of output 316 [2022-09-20 23:20:54,083 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:20:54,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 278 treesize of output 262 [2022-09-20 23:20:54,522 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-09-20 23:20:54,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 1 [2022-09-20 23:20:55,633 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-09-20 23:20:55,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280991009] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:20:55,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:20:55,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 31] total 86 [2022-09-20 23:20:55,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872128746] [2022-09-20 23:20:55,634 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:20:55,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-09-20 23:20:55,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:20:55,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-09-20 23:20:55,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=813, Invalid=5517, Unknown=14, NotChecked=966, Total=7310 [2022-09-20 23:20:55,638 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 159 [2022-09-20 23:20:55,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 746 transitions, 7580 flow. Second operand has 86 states, 86 states have (on average 56.593023255813954) internal successors, (4867), 86 states have internal predecessors, (4867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:20:55,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:20:55,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 159 [2022-09-20 23:20:55,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:21:25,228 INFO L130 PetriNetUnfolder]: 37415/62731 cut-off events. [2022-09-20 23:21:25,228 INFO L131 PetriNetUnfolder]: For 2246033/2248299 co-relation queries the response was YES. [2022-09-20 23:21:28,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454474 conditions, 62731 events. 37415/62731 cut-off events. For 2246033/2248299 co-relation queries the response was YES. Maximal size of possible extension queue 3471. Compared 591553 event pairs, 4336 based on Foata normal form. 336/61818 useless extension candidates. Maximal degree in co-relation 454348. Up to 19050 conditions per place. [2022-09-20 23:21:28,983 INFO L137 encePairwiseOnDemand]: 112/159 looper letters, 1091 selfloop transitions, 975 changer transitions 15/2148 dead transitions. [2022-09-20 23:21:28,983 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 2148 transitions, 29386 flow [2022-09-20 23:21:28,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-09-20 23:21:28,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2022-09-20 23:21:28,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 5494 transitions. [2022-09-20 23:21:28,988 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.392652944539737 [2022-09-20 23:21:28,988 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 5494 transitions. [2022-09-20 23:21:28,988 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 5494 transitions. [2022-09-20 23:21:28,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:21:28,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 5494 transitions. [2022-09-20 23:21:28,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 62.43181818181818) internal successors, (5494), 88 states have internal predecessors, (5494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:21:29,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 159.0) internal successors, (14151), 89 states have internal predecessors, (14151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:21:29,006 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 159.0) internal successors, (14151), 89 states have internal predecessors, (14151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:21:29,006 INFO L175 Difference]: Start difference. First operand has 456 places, 746 transitions, 7580 flow. Second operand 88 states and 5494 transitions. [2022-09-20 23:21:29,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 2148 transitions, 29386 flow [2022-09-20 23:22:13,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 490 places, 2148 transitions, 27280 flow, removed 1017 selfloop flow, removed 38 redundant places. [2022-09-20 23:22:13,820 INFO L231 Difference]: Finished difference. Result has 536 places, 1417 transitions, 18517 flow [2022-09-20 23:22:13,821 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=6710, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=746, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=372, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=18517, PETRI_PLACES=536, PETRI_TRANSITIONS=1417} [2022-09-20 23:22:13,822 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 394 predicate places. [2022-09-20 23:22:13,822 INFO L495 AbstractCegarLoop]: Abstraction has has 536 places, 1417 transitions, 18517 flow [2022-09-20 23:22:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 56.593023255813954) internal successors, (4867), 86 states have internal predecessors, (4867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:22:13,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:22:13,823 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:22:13,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-09-20 23:22:14,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:22:14,024 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:22:14,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:22:14,024 INFO L85 PathProgramCache]: Analyzing trace with hash 846668720, now seen corresponding path program 2 times [2022-09-20 23:22:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:22:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836498064] [2022-09-20 23:22:14,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:22:14,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:22:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:22:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:22:14,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:22:14,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836498064] [2022-09-20 23:22:14,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836498064] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:22:14,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052381721] [2022-09-20 23:22:14,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-20 23:22:14,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:22:14,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:22:14,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:22:14,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-09-20 23:22:14,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-20 23:22:14,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:22:14,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 57 conjunts are in the unsatisfiable core [2022-09-20 23:22:14,940 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:22:15,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-20 23:22:15,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-09-20 23:22:16,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:22:16,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 47 treesize of output 45 [2022-09-20 23:22:16,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:22:16,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 35 treesize of output 33 [2022-09-20 23:22:17,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:22:17,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:22:17,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 63 treesize of output 36 [2022-09-20 23:22:17,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:22:17,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:22:19,101 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (< c_~max2~0 c_~max3~0))) (and (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_285 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse0) (not (< c_~max3~0 .cse0))))) (not (< c_~max1~0 .cse1)) (= .cse1 c_~max2~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285))) (let ((.cse3 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max1~0 .cse3)) (= .cse3 c_~max2~0))))) .cse4) (or (= c_~max1~0 c_~max2~0) (and (or (forall ((~M~0 Int) (v_ArrVal_285 (Array Int Int)) (v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285))) (or (< c_~max3~0 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset))))) .cse4) (forall ((~M~0 Int)) (or (< 0 ~M~0) (< ~M~0 0) (forall ((v_ArrVal_285 (Array Int Int))) (or (forall ((v_ArrVal_287 (Array Int Int)) (v_ArrVal_286 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_286) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_287) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~max2~0 .cse6) (not (< c_~max3~0 .cse6))))) (< c_~max1~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_285) c_~A~0.base) c_~A~0.offset)))))))))) is different from false [2022-09-20 23:22:26,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:22:26,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 111 treesize of output 75 [2022-09-20 23:22:26,335 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:26,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 657 treesize of output 621 [2022-09-20 23:22:26,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 580 treesize of output 532 [2022-09-20 23:22:26,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 532 treesize of output 436 [2022-09-20 23:22:26,364 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:26,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 366 treesize of output 342 [2022-09-20 23:22:26,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:22:26,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 78 treesize of output 54 [2022-09-20 23:22:26,794 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:26,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 651 treesize of output 615 [2022-09-20 23:22:26,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 574 treesize of output 526 [2022-09-20 23:22:26,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-20 23:22:26,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 265 [2022-09-20 23:22:26,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 502 treesize of output 406 [2022-09-20 23:22:27,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:22:27,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 88 treesize of output 64 [2022-09-20 23:22:27,154 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:27,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 633 treesize of output 601 [2022-09-20 23:22:27,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 580 treesize of output 484 [2022-09-20 23:22:27,179 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:27,180 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 493 treesize of output 471 [2022-09-20 23:22:27,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 460 treesize of output 412 [2022-09-20 23:22:27,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:22:27,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 43 [2022-09-20 23:22:27,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:22:27,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-20 23:22:27,916 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:27,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 51 treesize of output 43 [2022-09-20 23:22:27,928 INFO L356 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-09-20 23:22:27,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 23 treesize of output 19 [2022-09-20 23:22:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 23:22:28,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052381721] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:22:28,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:22:28,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 30, 29] total 78 [2022-09-20 23:22:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240024285] [2022-09-20 23:22:28,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:22:28,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-09-20 23:22:28,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:22:28,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-09-20 23:22:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=900, Invalid=4909, Unknown=47, NotChecked=150, Total=6006 [2022-09-20 23:22:28,437 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 159 [2022-09-20 23:22:28,439 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 1417 transitions, 18517 flow. Second operand has 78 states, 78 states have (on average 59.717948717948715) internal successors, (4658), 78 states have internal predecessors, (4658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:22:28,440 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:22:28,440 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 159 [2022-09-20 23:22:28,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 23:23:17,186 INFO L130 PetriNetUnfolder]: 48824/81239 cut-off events. [2022-09-20 23:23:17,187 INFO L131 PetriNetUnfolder]: For 3178231/3181337 co-relation queries the response was YES. [2022-09-20 23:23:22,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646228 conditions, 81239 events. 48824/81239 cut-off events. For 3178231/3181337 co-relation queries the response was YES. Maximal size of possible extension queue 4556. Compared 783346 event pairs, 6069 based on Foata normal form. 497/80152 useless extension candidates. Maximal degree in co-relation 646072. Up to 26374 conditions per place. [2022-09-20 23:23:23,019 INFO L137 encePairwiseOnDemand]: 111/159 looper letters, 1207 selfloop transitions, 1429 changer transitions 24/2730 dead transitions. [2022-09-20 23:23:23,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 631 places, 2730 transitions, 43034 flow [2022-09-20 23:23:23,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-09-20 23:23:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2022-09-20 23:23:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 6760 transitions. [2022-09-20 23:23:23,026 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.4088050314465409 [2022-09-20 23:23:23,026 INFO L72 ComplementDD]: Start complementDD. Operand 104 states and 6760 transitions. [2022-09-20 23:23:23,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 104 states and 6760 transitions. [2022-09-20 23:23:23,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 23:23:23,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 104 states and 6760 transitions. [2022-09-20 23:23:23,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 105 states, 104 states have (on average 65.0) internal successors, (6760), 104 states have internal predecessors, (6760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:23:23,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 105 states, 105 states have (on average 159.0) internal successors, (16695), 105 states have internal predecessors, (16695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:23:23,047 INFO L81 ComplementDD]: Finished complementDD. Result has 105 states, 105 states have (on average 159.0) internal successors, (16695), 105 states have internal predecessors, (16695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:23:23,047 INFO L175 Difference]: Start difference. First operand has 536 places, 1417 transitions, 18517 flow. Second operand 104 states and 6760 transitions. [2022-09-20 23:23:23,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 631 places, 2730 transitions, 43034 flow [2022-09-20 23:24:56,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 2730 transitions, 41277 flow, removed 806 selfloop flow, removed 34 redundant places. [2022-09-20 23:24:56,588 INFO L231 Difference]: Finished difference. Result has 632 places, 1994 transitions, 31212 flow [2022-09-20 23:24:56,589 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=159, PETRI_DIFFERENCE_MINUEND_FLOW=17665, PETRI_DIFFERENCE_MINUEND_PLACES=494, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=911, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=104, PETRI_FLOW=31212, PETRI_PLACES=632, PETRI_TRANSITIONS=1994} [2022-09-20 23:24:56,590 INFO L287 CegarLoopForPetriNet]: 142 programPoint places, 490 predicate places. [2022-09-20 23:24:56,590 INFO L495 AbstractCegarLoop]: Abstraction has has 632 places, 1994 transitions, 31212 flow [2022-09-20 23:24:56,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 59.717948717948715) internal successors, (4658), 78 states have internal predecessors, (4658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:24:56,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 23:24:56,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 23:24:56,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-09-20 23:24:56,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:24:56,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-09-20 23:24:56,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 23:24:56,792 INFO L85 PathProgramCache]: Analyzing trace with hash -7519860, now seen corresponding path program 3 times [2022-09-20 23:24:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 23:24:56,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680502648] [2022-09-20 23:24:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 23:24:56,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 23:24:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 23:24:57,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:24:57,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 23:24:57,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680502648] [2022-09-20 23:24:57,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680502648] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-20 23:24:57,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203065931] [2022-09-20 23:24:57,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-20 23:24:57,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-20 23:24:57,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 23:24:57,389 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-20 23:24:57,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-09-20 23:24:57,469 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-09-20 23:24:57,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-20 23:24:57,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 38 conjunts are in the unsatisfiable core [2022-09-20 23:24:57,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-20 23:24:58,258 INFO L356 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-09-20 23:24:58,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 65 [2022-09-20 23:24:58,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:24:58,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-20 23:24:58,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-20 23:24:58,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 87 treesize of output 55 [2022-09-20 23:24:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-09-20 23:24:59,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203065931] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-20 23:24:59,264 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-20 23:24:59,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 18] total 46 [2022-09-20 23:24:59,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896534619] [2022-09-20 23:24:59,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-20 23:24:59,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-09-20 23:24:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 23:24:59,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-09-20 23:24:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1703, Unknown=0, NotChecked=0, Total=2070 [2022-09-20 23:24:59,268 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 159 [2022-09-20 23:24:59,269 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 1994 transitions, 31212 flow. Second operand has 46 states, 46 states have (on average 75.30434782608695) internal successors, (3464), 46 states have internal predecessors, (3464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 23:24:59,269 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 23:24:59,269 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 159 [2022-09-20 23:24:59,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand