/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/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-16 03:58:01,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 03:58:01,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 03:58:01,134 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 03:58:01,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 03:58:01,135 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 03:58:01,136 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 03:58:01,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 03:58:01,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 03:58:01,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 03:58:01,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 03:58:01,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 03:58:01,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 03:58:01,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 03:58:01,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 03:58:01,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 03:58:01,143 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 03:58:01,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 03:58:01,145 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 03:58:01,146 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 03:58:01,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 03:58:01,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 03:58:01,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 03:58:01,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 03:58:01,159 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 03:58:01,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 03:58:01,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 03:58:01,160 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 03:58:01,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 03:58:01,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 03:58:01,161 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 03:58:01,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 03:58:01,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 03:58:01,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 03:58:01,163 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 03:58:01,163 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 03:58:01,163 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 03:58:01,163 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 03:58:01,164 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 03:58:01,164 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 03:58:01,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 03:58:01,171 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-16 03:58:01,193 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 03:58:01,194 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 03:58:01,194 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 03:58:01,194 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 03:58:01,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 03:58:01,194 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 03:58:01,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 03:58:01,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 03:58:01,195 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 03:58:01,197 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 03:58:01,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 03:58:01,199 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 03:58:01,199 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 03:58:01,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 03:58:01,199 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-16 03:58:01,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 03:58:01,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 03:58:01,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 03:58:01,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-16 03:58:01,200 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP [2022-11-16 03:58:01,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 03:58:01,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 03:58:01,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 03:58:01,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 03:58:01,379 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 03:58:01,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-11-16 03:58:01,452 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14ca3015/a6d0ea9488514a13beb01ce5e30ffc71/FLAGd0e5c5995 [2022-11-16 03:58:01,809 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 03:58:01,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2022-11-16 03:58:01,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14ca3015/a6d0ea9488514a13beb01ce5e30ffc71/FLAGd0e5c5995 [2022-11-16 03:58:02,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d14ca3015/a6d0ea9488514a13beb01ce5e30ffc71 [2022-11-16 03:58:02,238 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 03:58:02,239 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-16 03:58:02,240 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 03:58:02,240 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 03:58:02,242 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 03:58:02,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44d727b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02, skipping insertion in model container [2022-11-16 03:58:02,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,247 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 03:58:02,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 03:58:02,439 WARN L233 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-min-array-hom.wvr.c[2586,2599] [2022-11-16 03:58:02,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 03:58:02,449 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 03:58:02,481 WARN L233 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-min-array-hom.wvr.c[2586,2599] [2022-11-16 03:58:02,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 03:58:02,496 INFO L208 MainTranslator]: Completed translation [2022-11-16 03:58:02,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02 WrapperNode [2022-11-16 03:58:02,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 03:58:02,497 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 03:58:02,497 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 03:58:02,497 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 03:58:02,502 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,531 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-16 03:58:02,531 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 03:58:02,532 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 03:58:02,532 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 03:58:02,532 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 03:58:02,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,550 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,555 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,557 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 03:58:02,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 03:58:02,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 03:58:02,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 03:58:02,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (1/1) ... [2022-11-16 03:58:02,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 03:58:02,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:02,587 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-11-16 03:58:02,595 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-11-16 03:58:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 03:58:02,623 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-16 03:58:02,624 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-16 03:58:02,624 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-16 03:58:02,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-16 03:58:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-16 03:58:02,625 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-16 03:58:02,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 03:58:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 03:58:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 03:58:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-16 03:58:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-16 03:58:02,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 03:58:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 03:58:02,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 03:58:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 03:58:02,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 03:58:02,631 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-16 03:58:02,703 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 03:58:02,705 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 03:58:02,923 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 03:58:02,960 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 03:58:02,960 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 03:58:02,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:58:02 BoogieIcfgContainer [2022-11-16 03:58:02,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 03:58:02,964 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 03:58:02,964 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 03:58:02,966 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 03:58:02,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 03:58:02" (1/3) ... [2022-11-16 03:58:02,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc14527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:58:02, skipping insertion in model container [2022-11-16 03:58:02,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 03:58:02" (2/3) ... [2022-11-16 03:58:02,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fc14527 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 03:58:02, skipping insertion in model container [2022-11-16 03:58:02,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 03:58:02" (3/3) ... [2022-11-16 03:58:02,970 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2022-11-16 03:58:02,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-16 03:58:02,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 03:58:02,982 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 03:58:02,982 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-16 03:58:03,042 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-16 03:58:03,094 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 03:58:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-16 03:58:03,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:03,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-16 03:58:03,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-16 03:58:03,141 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-16 03:58:03,150 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-16 03:58:03,154 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@48e7a72e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 03:58:03,154 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-16 03:58:03,364 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-11-16 03:58:03,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:03,369 INFO L85 PathProgramCache]: Analyzing trace with hash -275952594, now seen corresponding path program 1 times [2022-11-16 03:58:03,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:03,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342899459] [2022-11-16 03:58:03,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:03,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:03,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:03,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342899459] [2022-11-16 03:58:03,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342899459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:58:03,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:58:03,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 03:58:03,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058694962] [2022-11-16 03:58:03,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:58:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 03:58:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 03:58:03,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 03:58:03,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:03,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:03,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-16 03:58:03,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:03,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 03:58:03,696 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-11-16 03:58:03,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:03,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2072012938, now seen corresponding path program 1 times [2022-11-16 03:58:03,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:03,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121344835] [2022-11-16 03:58:03,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:03,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:04,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:04,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:04,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121344835] [2022-11-16 03:58:04,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121344835] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 03:58:04,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 03:58:04,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-16 03:58:04,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070954313] [2022-11-16 03:58:04,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:58:04,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 03:58:04,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:04,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 03:58:04,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-16 03:58:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:04,199 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:04,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 8 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-16 03:58:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:04,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:04,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:04,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:04,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 03:58:04,365 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-11-16 03:58:04,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:04,367 INFO L85 PathProgramCache]: Analyzing trace with hash 439153583, now seen corresponding path program 1 times [2022-11-16 03:58:04,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:04,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516957012] [2022-11-16 03:58:04,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:04,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:04,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:04,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:04,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516957012] [2022-11-16 03:58:04,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516957012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:04,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131256788] [2022-11-16 03:58:04,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:04,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:04,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:04,524 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-11-16 03:58:04,525 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-11-16 03:58:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:04,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-16 03:58:04,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:04,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:04,817 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:04,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:04,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131256788] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:04,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 03:58:04,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-16 03:58:04,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376981581] [2022-11-16 03:58:04,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:58:04,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 03:58:04,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:04,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 03:58:04,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-16 03:58:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:04,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:04,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 7 states have internal predecessors, (113), 0 states have call successors, (0), 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-11-16 03:58:04,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:04,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:04,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:05,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:05,070 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-11-16 03:58:05,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-16 03:58:05,261 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-11-16 03:58:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash 232719478, now seen corresponding path program 1 times [2022-11-16 03:58:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:05,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933728662] [2022-11-16 03:58:05,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:05,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:05,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933728662] [2022-11-16 03:58:05,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933728662] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:05,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375217496] [2022-11-16 03:58:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:05,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:05,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:05,413 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-11-16 03:58:05,459 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-11-16 03:58:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:05,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 03:58:05,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:05,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:05,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1375217496] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:05,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 03:58:05,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2022-11-16 03:58:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957807669] [2022-11-16 03:58:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 03:58:05,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-16 03:58:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:05,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-16 03:58:05,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2022-11-16 03:58:05,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:05,837 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:05,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.11111111111111) internal successors, (118), 9 states have internal predecessors, (118), 0 states have call successors, (0), 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-11-16 03:58:05,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:05,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:05,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:05,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:05,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:58:05,997 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-11-16 03:58:06,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:06,185 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-11-16 03:58:06,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:06,185 INFO L85 PathProgramCache]: Analyzing trace with hash 100827375, now seen corresponding path program 1 times [2022-11-16 03:58:06,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:06,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642465335] [2022-11-16 03:58:06,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:06,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:07,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:07,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642465335] [2022-11-16 03:58:07,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642465335] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:07,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776642791] [2022-11-16 03:58:07,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:07,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:07,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:07,588 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-11-16 03:58:07,626 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-11-16 03:58:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:07,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-16 03:58:07,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:08,590 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:08,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 43 [2022-11-16 03:58:09,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:09,219 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:09,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:09,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 75 [2022-11-16 03:58:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:11,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776642791] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:11,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:11,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 20, 19] total 53 [2022-11-16 03:58:11,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558481604] [2022-11-16 03:58:11,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:11,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-11-16 03:58:11,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-11-16 03:58:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2240, Unknown=0, NotChecked=0, Total=2756 [2022-11-16 03:58:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:11,059 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:11,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.773584905660377) internal successors, (306), 53 states have internal predecessors, (306), 0 states have call successors, (0), 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-11-16 03:58:11,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:11,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:11,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:11,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:58:11,059 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:13,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:58:13,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 03:58:13,169 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-11-16 03:58:13,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:13,357 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-11-16 03:58:13,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:13,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1303894886, now seen corresponding path program 2 times [2022-11-16 03:58:13,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:13,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505449018] [2022-11-16 03:58:13,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:13,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:13,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:13,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:13,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505449018] [2022-11-16 03:58:13,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505449018] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:13,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870894384] [2022-11-16 03:58:13,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:58:13,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:13,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:13,698 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-11-16 03:58:13,726 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-11-16 03:58:13,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:58:13,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:13,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-16 03:58:13,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:58:14,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 03:58:14,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870894384] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:14,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:14,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2022-11-16 03:58:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519291619] [2022-11-16 03:58:14,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:14,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-16 03:58:14,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:14,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-16 03:58:14,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2022-11-16 03:58:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:14,408 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:14,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.666666666666667) internal successors, (253), 33 states have internal predecessors, (253), 0 states have call successors, (0), 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-11-16 03:58:14,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:14,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:14,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:14,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:58:14,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-16 03:58:14,409 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:58:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-16 03:58:15,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:58:15,811 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-11-16 03:58:16,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:16,007 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-11-16 03:58:16,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1964803798, now seen corresponding path program 3 times [2022-11-16 03:58:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455331545] [2022-11-16 03:58:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:16,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:16,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455331545] [2022-11-16 03:58:16,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455331545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:16,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306432413] [2022-11-16 03:58:16,162 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 03:58:16,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:16,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:16,188 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-11-16 03:58:16,215 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-11-16 03:58:16,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 03:58:16,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:16,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:58:16,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:16,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:16,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:16,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306432413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:16,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:16,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 03:58:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49002254] [2022-11-16 03:58:16,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:16,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 03:58:16,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:16,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 03:58:16,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2022-11-16 03:58:16,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:16,589 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:16,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.125) internal successors, (219), 24 states have internal predecessors, (219), 0 states have call successors, (0), 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-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:58:16,590 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:58:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:58:17,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:58:17,520 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-11-16 03:58:17,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:17,716 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-11-16 03:58:17,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:17,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1094981842, now seen corresponding path program 1 times [2022-11-16 03:58:17,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:17,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703313640] [2022-11-16 03:58:17,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:17,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:17,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:18,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:18,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703313640] [2022-11-16 03:58:18,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703313640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:18,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618272760] [2022-11-16 03:58:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:18,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:18,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:18,007 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-11-16 03:58:18,010 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-11-16 03:58:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:18,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 03:58:18,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:18,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:18,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618272760] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:18,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:18,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 39 [2022-11-16 03:58:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077467997] [2022-11-16 03:58:18,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:18,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 03:58:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 03:58:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 03:58:18,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:18,775 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:18,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 7.435897435897436) internal successors, (290), 39 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-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:58:18,776 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:20,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:58:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:58:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:58:20,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-16 03:58:20,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:20,523 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-11-16 03:58:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1229161583, now seen corresponding path program 4 times [2022-11-16 03:58:20,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:20,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974083151] [2022-11-16 03:58:20,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974083151] [2022-11-16 03:58:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974083151] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802501383] [2022-11-16 03:58:21,801 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 03:58:21,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:21,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:21,802 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-11-16 03:58:21,810 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-11-16 03:58:21,888 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 03:58:21,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:21,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-16 03:58:21,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:22,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:58:22,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 03:58:23,065 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:23,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-16 03:58:23,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:23,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:25,941 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:25,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 276 treesize of output 276 [2022-11-16 03:58:25,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 163 [2022-11-16 03:58:25,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 157 [2022-11-16 03:58:25,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 145 [2022-11-16 03:58:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:29,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802501383] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:29,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:29,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 72 [2022-11-16 03:58:29,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674981877] [2022-11-16 03:58:29,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:29,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 03:58:29,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:29,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 03:58:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=4404, Unknown=11, NotChecked=0, Total=5112 [2022-11-16 03:58:29,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:29,784 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:29,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 4.25) internal successors, (306), 72 states have internal predecessors, (306), 0 states have call successors, (0), 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-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:58:29,784 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:58:29,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:58:29,785 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:58:32,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:58:32,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:58:32,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 03:58:33,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 03:58:33,135 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-11-16 03:58:33,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:58:33,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1717655339, now seen corresponding path program 5 times [2022-11-16 03:58:33,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:58:33,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255141990] [2022-11-16 03:58:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:58:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:58:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:58:34,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:34,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:58:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255141990] [2022-11-16 03:58:34,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255141990] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:58:34,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099202946] [2022-11-16 03:58:34,942 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 03:58:34,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:58:34,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:58:34,944 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:58:34,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 03:58:35,024 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:58:35,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:58:35,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-16 03:58:35,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:58:35,059 INFO L350 Elim1Store]: Elim1 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-11-16 03:58:35,091 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 03:58:35,091 INFO L350 Elim1Store]: Elim1 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-11-16 03:58:35,128 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 03:58:35,129 INFO L350 Elim1Store]: Elim1 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-11-16 03:58:35,455 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-11-16 03:58:35,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 30 [2022-11-16 03:58:35,623 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2022-11-16 03:58:35,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 03:58:36,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:58:36,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11-16 03:58:36,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-11-16 03:58:36,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:36,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-16 03:58:37,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:58:37,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:58:44,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse8 (= c_~min2~0 c_~min1~0)) (.cse5 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (= c_~min3~0 .cse1) (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (not (< .cse1 c_~min1~0))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse4 c_~min3~0)) (= c_~min1~0 .cse4) (<= c_~min2~0 .cse4))))))) (or .cse5 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse7 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= c_~min2~0 .cse7) (not (< .cse7 c_~min1~0))))))) (or .cse8 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse9 c_~min2~0) (< 0 ~M~0) (< (select (select .cse10 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< ~M~0 0) (not (< .cse9 c_~min3~0))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse11 (select (select .cse13 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse11) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< .cse12 c_~min2~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse12 c_~min3~0))))) (not (< .cse11 c_~min1~0)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse15 (select (select .cse16 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse14 .cse15) (< 0 ~M~0) (< ~M~0 0) (not (< .cse14 c_~min3~0)) (<= c_~min2~0 .cse14)))) (not (< .cse15 c_~min1~0)))))) (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse8 .cse5)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< (select (select .cse17 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< ~M~0 0) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0))))))) is different from false [2022-11-16 03:58:45,750 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (<= c_~min2~0 c_~min3~0)) (.cse5 (= c_~min2~0 c_~min1~0)) (.cse11 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse0 c_~min3~0)) (= .cse0 .cse1) (<= c_~min2~0 .cse0)))) (not (< .cse1 c_~min1~0)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< (select (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (= c_~min1~0 .cse4) (not (< .cse4 c_~min3~0)) (<= c_~min2~0 .cse4))))))) (or .cse5 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse6 c_~min2~0) (< (select (select .cse7 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< ~M~0 0) (not (< .cse6 c_~min3~0))))))) (or .cse8 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (= .cse10 c_~min3~0) (< ~M~0 0) (not (< .cse10 c_~min1~0))))))) (or (and (or .cse8 (= c_~min1~0 c_~min3~0)) (or .cse5 .cse11)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< (select (select .cse12 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< ~M~0 0))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse14 (select (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< ~M~0 0) (not (< .cse14 c_~min1~0)) (= c_~min2~0 .cse14))))) .cse11) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse15 (select (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse15 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (< .cse16 c_~min2~0) (< ~M~0 0) (not (< .cse16 c_~min3~0))))) (= c_~min2~0 .cse15))))))) is different from false [2022-11-16 03:58:45,964 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse7 (< c_~min3~0 c_~min2~0)) (.cse11 (<= c_~min2~0 c_~min3~0))) (and (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< .cse1 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< .cse1 c_~min2~0)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse4 c_~min1~0) (not (< .cse4 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse4))))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< 0 ~M~0) (not (< .cse5 c_~min1~0)) (= c_~min2~0 .cse5) (< ~M~0 0) (< (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) .cse7) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse8 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse9 .cse8) (not (< .cse9 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse9)))))))) (or (and (or .cse11 (= c_~min1~0 c_~min3~0)) (or .cse0 .cse7)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse15 (select (select .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< .cse13 c_~min3~0)) (< 0 ~M~0) (< ~M~0 0) (< .cse13 c_~min2~0)))) (not (< .cse15 c_~min1~0)) (= c_~min2~0 .cse15))))) (or .cse11 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse16 c_~min3~0) (< 0 ~M~0) (not (< .cse16 c_~min1~0)) (< ~M~0 0) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min3~0)))))))) is different from false [2022-11-16 03:58:46,104 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (<= c_~min2~0 c_~min3~0)) (.cse6 (= c_~min2~0 c_~min1~0)) (.cse16 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse1 c_~min1~0)) (< 0 ~M~0) (= c_~min3~0 .cse1) (< ~M~0 0) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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|)) c_~min3~0)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse5 (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 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< 0 ~M~0) (not (< .cse3 c_~min3~0)) (< ~M~0 0) (< .cse3 c_~min2~0)))) (not (< .cse5 c_~min1~0)) (= c_~min2~0 .cse5))))) (or .cse6 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse8 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< 0 ~M~0) (not (< .cse8 c_~min3~0)) (< ~M~0 0) (< .cse8 c_~min2~0)))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse9 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse10 (select (select (store (store .cse11 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< 0 ~M~0) (not (< .cse10 c_~min3~0)) (< ~M~0 0) (= .cse9 .cse10) (<= c_~min2~0 .cse10)))))))) (forall ((v_ArrVal_291 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< (select (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse13 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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 (< 0 ~M~0) (not (< .cse13 c_~min3~0)) (< ~M~0 0) (<= c_~min2~0 .cse13) (= c_~min1~0 .cse13))))))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (let ((.cse14 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse14 c_~min1~0)) (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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|)) c_~min3~0) (= c_~min2~0 .cse14))))) .cse16) (or (and (or .cse0 (= c_~min1~0 c_~min3~0)) (or .cse6 .cse16)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int)) (v_ArrVal_293 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_291))) (or (< (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0) (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) |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|)) c_~min3~0))))))) is different from false [2022-11-16 03:58:46,691 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:46,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-16 03:58:46,698 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:46,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 177 [2022-11-16 03:58:46,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2022-11-16 03:58:46,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 100 [2022-11-16 03:58:46,714 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:46,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2022-11-16 03:58:46,831 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:46,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 64 [2022-11-16 03:58:46,841 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:46,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 633 treesize of output 601 [2022-11-16 03:58:46,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 440 treesize of output 392 [2022-11-16 03:58:46,861 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:46,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 541 treesize of output 519 [2022-11-16 03:58:46,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 508 treesize of output 412 [2022-11-16 03:58:47,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:47,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-11-16 03:58:47,486 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:47,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 177 [2022-11-16 03:58:47,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2022-11-16 03:58:47,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 100 [2022-11-16 03:58:47,536 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:47,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2022-11-16 03:58:47,667 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:58:47,667 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 43 [2022-11-16 03:58:47,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:58:47,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:58:47,676 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:47,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-11-16 03:58:47,686 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-16 03:58:47,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-16 03:58:47,705 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 03:58:47,705 INFO L350 Elim1Store]: Elim1 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 120 treesize of output 1 [2022-11-16 03:58:47,712 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 03:58:47,712 INFO L350 Elim1Store]: Elim1 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 140 treesize of output 1 [2022-11-16 03:58:47,718 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 03:58:47,722 INFO L350 Elim1Store]: Elim1 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 111 treesize of output 1 [2022-11-16 03:58:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-16 03:58:48,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099202946] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:58:48,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:58:48,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 28] total 77 [2022-11-16 03:58:48,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130646963] [2022-11-16 03:58:48,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:58:48,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-11-16 03:58:48,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:58:48,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-11-16 03:58:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=4515, Unknown=23, NotChecked=580, Total=5852 [2022-11-16 03:58:48,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:48,792 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:58:48,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 4.311688311688312) internal successors, (332), 77 states have internal predecessors, (332), 0 states have call successors, (0), 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-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-11-16 03:58:48,793 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:07,707 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| c_~A~0.base))) (let ((.cse16 (select .cse20 c_~A~0.offset)) (.cse5 (<= c_~min2~0 c_~min3~0)) (.cse11 (= c_~min2~0 c_~min1~0)) (.cse6 (< c_~min3~0 c_~min2~0)) (.cse3 (select .cse20 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse7 (< .cse3 c_~min1~0)) (.cse1 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (not (< .cse19 c_~min3~0)) (< .cse19 c_~min2~0))))) (.cse9 (and (or .cse5 (= c_~min1~0 c_~min3~0)) (or .cse11 .cse6))) (.cse4 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)))) (.cse13 (< .cse16 c_~min1~0)) (.cse10 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (or (< 0 ~M~0) (< ~M~0 0) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0)))) (.cse12 (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (not (< .cse18 c_~min3~0)) (< .cse18 c_~min2~0)))))) (and (or (let ((.cse0 (= c_~min2~0 .cse3))) (and (or .cse0 .cse1) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (<= c_~min2~0 .cse2) (not (< .cse2 c_~min3~0)) (= .cse3 .cse2)))) (or .cse4 (and (or .cse5 (= .cse3 c_~min3~0)) (or .cse0 .cse6))))) (not .cse7)) (or (and (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse8) (not (< .cse8 c_~min3~0)) (= c_~min1~0 .cse8)))) (or .cse9 .cse10) (or .cse11 .cse12)) .cse13) (or .cse7 (and (or .cse11 .cse1) (or .cse9 .cse4) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (<= c_~min2~0 .cse14) (not (< .cse14 c_~min3~0)) (= c_~min1~0 .cse14)))))) (or (not .cse13) (let ((.cse17 (= c_~min2~0 .cse16))) (and (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_293 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_293) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< ~M~0 0) (<= c_~min2~0 .cse15) (not (< .cse15 c_~min3~0)) (= .cse16 .cse15)))) (or (and (or .cse6 .cse17) (or .cse5 (= .cse16 c_~min3~0))) .cse10) (or .cse12 .cse17)))))))) is different from false [2022-11-16 03:59:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:59:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:59:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 03:59:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:59:09,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 03:59:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 03:59:09,982 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-11-16 03:59:09,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:59:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1206971023, now seen corresponding path program 6 times [2022-11-16 03:59:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:59:09,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681556434] [2022-11-16 03:59:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:59:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:10,169 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:10,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:59:10,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681556434] [2022-11-16 03:59:10,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681556434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:59:10,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326023312] [2022-11-16 03:59:10,169 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 03:59:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:59:10,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:59:10,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 03:59:10,304 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-16 03:59:10,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:59:10,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:59:10,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:59:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:59:10,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:59:10,656 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:59:10,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326023312] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:59:10,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:59:10,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-16 03:59:10,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848489224] [2022-11-16 03:59:10,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:59:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 03:59:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:59:10,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 03:59:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2022-11-16 03:59:10,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:10,659 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:59:10,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 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-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:59:10,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:59:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 03:59:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:59:13,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:59:13,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 03:59:13,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-16 03:59:13,436 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:59:13,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:59:13,437 INFO L85 PathProgramCache]: Analyzing trace with hash 333021814, now seen corresponding path program 7 times [2022-11-16 03:59:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:59:13,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692247685] [2022-11-16 03:59:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:59:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:16,156 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:16,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:59:16,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692247685] [2022-11-16 03:59:16,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692247685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:59:16,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341802062] [2022-11-16 03:59:16,156 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-16 03:59:16,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:16,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:59:16,158 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:59:16,159 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 03:59:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:16,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-16 03:59:16,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:59:17,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:59:17,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:59:17,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 160 treesize of output 108 [2022-11-16 03:59:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:18,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:59:22,182 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 03:59:22,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 621 treesize of output 265 [2022-11-16 03:59:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:25,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341802062] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:59:25,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:59:25,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 33, 27] total 86 [2022-11-16 03:59:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488882661] [2022-11-16 03:59:25,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:59:25,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-11-16 03:59:25,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:59:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-11-16 03:59:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=6438, Unknown=0, NotChecked=0, Total=7310 [2022-11-16 03:59:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:25,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:59:25,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 4.267441860465116) internal successors, (367), 86 states have internal predecessors, (367), 0 states have call successors, (0), 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-11-16 03:59:25,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:25,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:25,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:59:25,609 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:59:35,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-11-16 03:59:35,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 03:59:35,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-16 03:59:35,335 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:59:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:59:35,336 INFO L85 PathProgramCache]: Analyzing trace with hash 648238083, now seen corresponding path program 8 times [2022-11-16 03:59:35,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:59:35,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353564679] [2022-11-16 03:59:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:59:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:35,508 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:35,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:59:35,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353564679] [2022-11-16 03:59:35,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353564679] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:59:35,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085440323] [2022-11-16 03:59:35,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:59:35,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:35,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:59:35,510 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:59:35,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 03:59:35,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:59:35,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:59:35,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-16 03:59:35,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:59:35,799 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:35,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:59:35,996 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 25 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:35,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085440323] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:59:35,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:59:35,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 34 [2022-11-16 03:59:35,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742406431] [2022-11-16 03:59:35,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:59:35,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 03:59:35,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:59:35,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 03:59:35,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=915, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 03:59:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:35,998 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:59:35,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.647058823529412) internal successors, (260), 34 states have internal predecessors, (260), 0 states have call successors, (0), 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-11-16 03:59:35,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:35,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 51 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-11-16 03:59:35,999 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:59:39,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 03:59:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-11-16 03:59:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:39,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:59:39,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 03:59:40,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 03:59:40,116 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:59:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:59:40,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1304833281, now seen corresponding path program 2 times [2022-11-16 03:59:40,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:59:40,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283563379] [2022-11-16 03:59:40,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:59:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:40,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:59:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283563379] [2022-11-16 03:59:40,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283563379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:59:40,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009596602] [2022-11-16 03:59:40,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:59:40,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:40,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:59:40,275 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:59:40,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 03:59:40,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:59:40,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:59:40,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:59:40,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:59:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:59:40,565 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:59:40,747 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:59:40,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009596602] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:59:40,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:59:40,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 29 [2022-11-16 03:59:40,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674007081] [2022-11-16 03:59:40,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:59:40,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-16 03:59:40,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:59:40,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-16 03:59:40,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2022-11-16 03:59:40,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:40,749 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:59:40,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 8.275862068965518) internal successors, (240), 29 states have internal predecessors, (240), 0 states have call successors, (0), 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-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:40,749 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:59:40,750 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:59:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:59:44,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 03:59:44,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-16 03:59:44,327 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:59:44,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:59:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 6681437, now seen corresponding path program 1 times [2022-11-16 03:59:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:59:44,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094638139] [2022-11-16 03:59:44,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:59:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:44,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:59:44,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094638139] [2022-11-16 03:59:44,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094638139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:59:44,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812571795] [2022-11-16 03:59:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:44,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:44,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:59:44,451 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:59:44,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 03:59:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:44,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 03:59:44,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:59:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:44,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 03:59:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:44,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812571795] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 03:59:44,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 03:59:44,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2022-11-16 03:59:44,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640290331] [2022-11-16 03:59:44,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 03:59:44,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-11-16 03:59:44,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 03:59:44,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-11-16 03:59:44,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2022-11-16 03:59:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:44,945 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 03:59:44,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 9.5) internal successors, (228), 24 states have internal predecessors, (228), 0 states have call successors, (0), 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-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 80 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 90 states. [2022-11-16 03:59:44,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 03:59:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 03:59:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2022-11-16 03:59:45,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 03:59:45,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 03:59:45,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:45,569 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 03:59:45,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 03:59:45,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1755799160, now seen corresponding path program 2 times [2022-11-16 03:59:45,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 03:59:45,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213063224] [2022-11-16 03:59:45,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 03:59:45,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 03:59:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 03:59:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 03:59:47,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 03:59:47,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213063224] [2022-11-16 03:59:47,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213063224] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 03:59:47,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12157591] [2022-11-16 03:59:47,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 03:59:47,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 03:59:47,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 03:59:47,289 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 03:59:47,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 03:59:47,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 03:59:47,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 03:59:47,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-16 03:59:47,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 03:59:47,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 03:59:48,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 03:59:48,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 03:59:48,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 03:59:49,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 03:59:49,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 03:59:49,082 INFO L321 Elim1Store]: treesize reduction 24, result has 72.7 percent of original size [2022-11-16 03:59:49,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 143 [2022-11-16 03:59:50,737 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 03:59:50,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:01:30,559 WARN L233 SmtUtils]: Spent 1.42m on a formula simplification. DAG size of input: 197 DAG size of output: 168 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:02:27,298 WARN L233 SmtUtils]: Spent 47.38s on a formula simplification that was a NOOP. DAG size: 166 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 04:02:28,889 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse103 (* c_thread1Thread1of1ForFork2_~i~0 4)) (.cse14 (+ c_~min3~0 1))) (let ((.cse6 (= c_~min2~0 c_~min1~0)) (.cse21 (<= .cse14 c_~min2~0)) (.cse22 (<= c_~min2~0 c_~min3~0)) (.cse33 (= c_~min1~0 c_~min3~0)) (.cse1 (+ c_thread1Thread1of1ForFork2_~i~0 1)) (.cse3 (+ c_~A~0.offset .cse103 4)) (.cse5 (+ c_~A~0.offset .cse103))) (and (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse4 (select .cse2 .cse5))) (or (forall ((~M~0 Int)) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse0 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse0 1) c_~min2~0)))) (< (select .cse2 .cse3) .cse4) (= c_~min2~0 .cse4) (not (< .cse4 c_~min1~0)) (< (select .cse2 c_~A~0.offset) c_~min2~0))))) (or .cse6 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse8 (select .cse7 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (< (select .cse7 .cse3) c_~min1~0) (not (< .cse8 c_~min3~0)) (< .cse1 ~M~0) (< (select .cse7 .cse5) c_~min1~0) (<= (+ .cse8 1) c_~min2~0) (< (select .cse7 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (or (< (select .cse9 .cse3) c_~min1~0) (forall ((~M~0 Int)) (let ((.cse10 (select .cse9 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse10 c_~min3~0)) (< .cse1 ~M~0) (= c_~min1~0 .cse10) (<= c_~min2~0 .cse10)))) (< (select .cse9 .cse5) c_~min1~0) (< (select .cse9 c_~A~0.offset) c_~min2~0)))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset)) (.cse13 (select .cse12 .cse3))) (or (not (< .cse11 c_~min2~0)) (< (select .cse12 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse11 .cse13) (< (select .cse12 .cse5) c_~min1~0) (<= .cse14 .cse11) (not (< .cse13 c_~min1~0)))))) (< .cse1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse15 (select .cse18 .cse3)) (.cse16 (select .cse18 .cse5)) (.cse17 (select .cse18 c_~A~0.offset))) (or (not (< .cse15 .cse16)) (not (< .cse17 c_~min2~0)) (< (select .cse18 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse17 .cse15) (not (< .cse16 c_~min1~0)) (<= .cse14 .cse17))))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse19 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse20 (select .cse19 .cse5))) (or (not (< 0 ~M~0)) (< (select .cse19 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse19 .cse3) .cse20) (< .cse1 ~M~0) (= c_~min2~0 .cse20) (not (< .cse20 c_~min1~0)) (< (select .cse19 c_~A~0.offset) c_~min2~0))))) .cse21) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse24 (select .cse23 .cse3))) (or (not (< 0 ~M~0)) (< (select .cse23 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< .cse1 ~M~0) (= .cse24 c_~min3~0) (< (select .cse23 .cse5) c_~min1~0) (not (< .cse24 c_~min1~0)) (< (select .cse23 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse28 (select .cse26 .cse5)) (.cse27 (select .cse26 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse25 (select .cse26 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse25 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse25 1) c_~min2~0)))) (not (< .cse27 .cse28)) (not (< .cse28 c_~min1~0)) (= c_~min2~0 .cse27) (< (select .cse26 c_~A~0.offset) c_~min2~0))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse29 (select .cse30 c_~A~0.offset)) (.cse31 (select .cse30 .cse5))) (or (not (< .cse29 c_~min2~0)) (< (select .cse30 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse30 .cse3) .cse31) (<= .cse29 c_~min3~0) (not (< .cse31 c_~min1~0)) (= .cse31 c_~min3~0))))) (not (< 0 ~M~0)) (< .cse1 ~M~0))) (or (and .cse6 .cse22) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (or (not (< 0 ~M~0)) (< (select .cse32 .cse3) c_~min1~0) (< (select .cse32 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< .cse1 ~M~0) (< (select .cse32 .cse5) c_~min1~0) (< (select .cse32 c_~A~0.offset) c_~min2~0)))) (and .cse33 .cse21)) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse35 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse34 (select .cse35 c_~A~0.offset)) (.cse36 (select .cse35 .cse5))) (or (not (< .cse34 c_~min2~0)) (< (select .cse35 .cse3) .cse36) (= .cse34 .cse36) (forall ((~M~0 Int)) (let ((.cse37 (select .cse35 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse37 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse37 1) .cse34)))) (not (< .cse36 c_~min1~0)))))) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse38 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse39 (select .cse38 .cse5))) (or (not (< 0 ~M~0)) (< (select .cse38 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse38 .cse3) .cse39) (< .cse1 ~M~0) (not (< .cse39 c_~min1~0)) (= .cse39 c_~min3~0) (< (select .cse38 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse40 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse41 (select .cse40 .cse5))) (or (< (select .cse40 .cse3) .cse41) (forall ((~M~0 Int)) (let ((.cse42 (select .cse40 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse42 c_~min3~0)) (< .cse1 ~M~0) (= .cse41 .cse42) (<= c_~min2~0 .cse42)))) (not (< .cse41 c_~min1~0)) (< (select .cse40 c_~A~0.offset) c_~min2~0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse43 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse43 c_~min3~0)) (< .cse1 ~M~0) (= .cse44 .cse43) (<= c_~min2~0 .cse43)))) (< (select .cse45 .cse5) c_~min1~0) (not (< .cse44 c_~min1~0)) (< (select .cse45 c_~A~0.offset) c_~min2~0))))) (or .cse21 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse48 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse47 (select .cse48 .cse5)) (.cse46 (select .cse48 .cse3))) (or (not (< .cse46 .cse47)) (not (< 0 ~M~0)) (< (select .cse48 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< .cse1 ~M~0) (not (< .cse47 c_~min1~0)) (= c_~min2~0 .cse46) (< (select .cse48 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse49 (select .cse53 .cse3)) (.cse51 (select .cse53 c_~A~0.offset)) (.cse50 (select .cse53 .cse5))) (or (not (< .cse49 .cse50)) (not (< .cse51 c_~min2~0)) (= .cse51 .cse49) (forall ((~M~0 Int)) (let ((.cse52 (select .cse53 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse52 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse52 1) .cse51)))) (not (< .cse50 c_~min1~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse55 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse56 (select .cse55 .cse5)) (.cse54 (select .cse55 c_~A~0.offset))) (or (not (< .cse54 c_~min2~0)) (< (select .cse55 .cse3) .cse56) (not (< .cse56 c_~min1~0)) (forall ((~M~0 Int)) (let ((.cse57 (select .cse55 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse57 c_~min3~0)) (< .cse1 ~M~0) (= .cse56 .cse57) (<= .cse54 .cse57)))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse59 (select .cse61 .cse3)) (.cse60 (select .cse61 c_~A~0.offset)) (.cse62 (select .cse61 .cse5))) (or (forall ((~M~0 Int)) (let ((.cse58 (select .cse61 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse58 c_~min3~0)) (< .cse1 ~M~0) (= .cse59 .cse58) (<= .cse60 .cse58)))) (not (< .cse59 .cse62)) (not (< .cse60 c_~min2~0)) (not (< .cse62 c_~min1~0)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse63 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse64 (select .cse63 .cse3))) (or (not (< 0 ~M~0)) (< (select .cse63 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< .cse1 ~M~0) (< (select .cse63 .cse5) c_~min1~0) (not (< .cse64 c_~min1~0)) (= c_~min2~0 .cse64) (< (select .cse63 c_~A~0.offset) c_~min2~0))))) .cse21) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse66 (select .cse65 c_~A~0.offset))) (or (< (select .cse65 .cse3) c_~min1~0) (not (< .cse66 c_~min2~0)) (< (select .cse65 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse65 .cse5) c_~min1~0) (= c_~min1~0 .cse66) (<= .cse14 .cse66))))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse70 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse69 (select .cse70 c_~A~0.offset)) (.cse68 (select .cse70 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse67 (select .cse70 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse67 c_~min3~0)) (< .cse1 ~M~0) (= .cse68 .cse67) (<= .cse69 .cse67)))) (not (< .cse69 c_~min2~0)) (< (select .cse70 .cse5) c_~min1~0) (not (< .cse68 c_~min1~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse71 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse72 (select .cse71 c_~A~0.offset))) (or (< (select .cse71 .cse3) c_~min1~0) (not (< .cse72 c_~min2~0)) (forall ((~M~0 Int)) (let ((.cse73 (select .cse71 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse73 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse73 1) .cse72)))) (< (select .cse71 .cse5) c_~min1~0) (= c_~min1~0 .cse72))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse75 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse74 (select .cse75 c_~A~0.offset)) (.cse76 (select .cse75 .cse3))) (or (not (< .cse74 c_~min2~0)) (< (select .cse75 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse76 c_~min3~0) (<= .cse74 c_~min3~0) (< (select .cse75 .cse5) c_~min1~0) (not (< .cse76 c_~min1~0)))))) (not (< 0 ~M~0)) (< .cse1 ~M~0))) (or .cse22 (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse79 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse77 (select .cse79 .cse3)) (.cse78 (select .cse79 .cse5))) (or (not (< .cse77 .cse78)) (not (< 0 ~M~0)) (< (select .cse79 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< .cse1 ~M~0) (= .cse77 c_~min3~0) (not (< .cse78 c_~min1~0)) (< (select .cse79 c_~A~0.offset) c_~min2~0)))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse81 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse82 (select .cse81 .cse3))) (or (forall ((~M~0 Int)) (let ((.cse80 (select .cse81 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse80 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse80 1) c_~min2~0)))) (< (select .cse81 .cse5) c_~min1~0) (not (< .cse82 c_~min1~0)) (= c_~min2~0 .cse82) (< (select .cse81 c_~A~0.offset) c_~min2~0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse86 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse83 (select .cse86 .cse3)) (.cse84 (select .cse86 .cse5))) (or (not (< .cse83 .cse84)) (forall ((~M~0 Int)) (let ((.cse85 (select .cse86 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse85 c_~min3~0)) (< .cse1 ~M~0) (= .cse83 .cse85) (<= c_~min2~0 .cse85)))) (not (< .cse84 c_~min1~0)) (< (select .cse86 c_~A~0.offset) c_~min2~0))))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse90 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse87 (select .cse90 c_~A~0.offset)) (.cse88 (select .cse90 .cse3))) (or (not (< .cse87 c_~min2~0)) (= .cse87 .cse88) (forall ((~M~0 Int)) (let ((.cse89 (select .cse90 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse89 c_~min3~0)) (< .cse1 ~M~0) (<= (+ .cse89 1) .cse87)))) (< (select .cse90 .cse5) c_~min1~0) (not (< .cse88 c_~min1~0)))))) (or (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int)) (~M~0 Int)) (let ((.cse91 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse92 (select .cse91 c_~A~0.offset))) (or (not (< 0 ~M~0)) (< (select .cse91 .cse3) c_~min1~0) (not (< .cse92 c_~min2~0)) (< (select .cse91 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< .cse1 ~M~0) (<= .cse92 c_~min3~0) (< (select .cse91 .cse5) c_~min1~0))))) .cse33) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (not (< 0 ~M~0)) (< .cse1 ~M~0) (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse94 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse95 (select .cse94 .cse5)) (.cse93 (select .cse94 c_~A~0.offset))) (or (not (< .cse93 c_~min2~0)) (< (select .cse94 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (select .cse94 .cse3) .cse95) (= .cse93 .cse95) (not (< .cse95 c_~min1~0)) (<= .cse14 .cse93))))))) (forall ((v_ArrVal_513 (Array Int Int)) (~M~0 Int)) (or (forall ((v_ArrVal_514 (Array Int Int))) (let ((.cse99 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse96 (select .cse99 .cse3)) (.cse98 (select .cse99 c_~A~0.offset)) (.cse97 (select .cse99 .cse5))) (or (not (< .cse96 .cse97)) (not (< .cse98 c_~min2~0)) (< (select .cse99 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (= .cse96 c_~min3~0) (<= .cse98 c_~min3~0) (not (< .cse97 c_~min1~0)))))) (not (< 0 ~M~0)) (< .cse1 ~M~0))) (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_514 (Array Int Int))) (let ((.cse102 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_514) c_~A~0.base))) (let ((.cse101 (select .cse102 c_~A~0.offset))) (or (forall ((~M~0 Int)) (let ((.cse100 (select .cse102 (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< 0 ~M~0)) (not (< .cse100 c_~min3~0)) (< .cse1 ~M~0) (= c_~min1~0 .cse100) (<= .cse101 .cse100)))) (< (select .cse102 .cse3) c_~min1~0) (not (< .cse101 c_~min2~0)) (< (select .cse102 .cse5) c_~min1~0)))))))) is different from false [2022-11-16 04:02:57,619 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:02:57,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 184 treesize of output 124 [2022-11-16 04:02:57,636 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:57,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1640 treesize of output 1568 [2022-11-16 04:02:57,669 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:57,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1564 treesize of output 1360 [2022-11-16 04:02:57,703 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:57,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1356 treesize of output 1256 [2022-11-16 04:02:57,741 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:57,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 762 treesize of output 714 [2022-11-16 04:02:58,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:02:58,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 100 [2022-11-16 04:02:58,641 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:58,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2303 treesize of output 2195 [2022-11-16 04:02:58,677 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:58,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2191 treesize of output 1907 [2022-11-16 04:02:58,718 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:58,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1903 treesize of output 1763 [2022-11-16 04:02:58,756 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:02:58,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1759 treesize of output 1691 [2022-11-16 04:03:01,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:03:01,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 83 [2022-11-16 04:03:01,400 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:03:01,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 493 treesize of output 475 [2022-11-16 04:03:01,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:03:01,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 04:03:01,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 241 treesize of output 227 [2022-11-16 04:03:01,440 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:03:01,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 457 treesize of output 405 [2022-11-16 04:03:01,465 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-16 04:03:01,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 401 treesize of output 377 [2022-11-16 04:03:01,717 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2022-11-16 04:03:01,726 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-16 04:03:01,734 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 174 treesize of output 1 [2022-11-16 04:03:01,742 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 1 [2022-11-16 04:03:01,753 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 1 [2022-11-16 04:03:01,762 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 1 [2022-11-16 04:03:01,770 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 1 [2022-11-16 04:03:01,776 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 1 [2022-11-16 04:03:01,784 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2022-11-16 04:03:01,793 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 1 [2022-11-16 04:03:01,801 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 1 [2022-11-16 04:03:01,810 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 1 [2022-11-16 04:03:01,819 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 1 [2022-11-16 04:03:01,829 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 1 [2022-11-16 04:03:01,836 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 1 [2022-11-16 04:03:01,844 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-16 04:03:01,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 173 treesize of output 1 [2022-11-16 04:03:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 04:03:02,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12157591] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:03:02,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:03:02,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 35, 28] total 76 [2022-11-16 04:03:02,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204512546] [2022-11-16 04:03:02,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:03:02,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-11-16 04:03:02,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:03:02,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-11-16 04:03:02,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4751, Unknown=99, NotChecked=146, Total=5700 [2022-11-16 04:03:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:03:02,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:03:02,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 76 states have (on average 4.75) internal successors, (361), 76 states have internal predecessors, (361), 0 states have call successors, (0), 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-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:03:02,653 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 91 states. [2022-11-16 04:03:02,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:03:02,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:04:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-11-16 04:04:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:04:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:04:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:04:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2022-11-16 04:04:00,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 04:04:01,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 04:04:01,110 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:04:01,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:04:01,111 INFO L85 PathProgramCache]: Analyzing trace with hash -2017837283, now seen corresponding path program 3 times [2022-11-16 04:04:01,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:04:01,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172171866] [2022-11-16 04:04:01,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:04:01,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:04:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:04:01,339 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:04:01,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:04:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172171866] [2022-11-16 04:04:01,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172171866] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:04:01,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258686574] [2022-11-16 04:04:01,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 04:04:01,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:04:01,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:04:01,340 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:04:01,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 04:04:01,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 04:04:01,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:04:01,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 04:04:01,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:04:01,704 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:04:01,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:04:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 04:04:01,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258686574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:04:01,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:04:01,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 12] total 36 [2022-11-16 04:04:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852413414] [2022-11-16 04:04:01,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:04:01,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-16 04:04:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:04:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-16 04:04:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-11-16 04:04:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:04:01,944 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:04:01,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 7.638888888888889) internal successors, (275), 36 states have internal predecessors, (275), 0 states have call successors, (0), 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-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 82 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 92 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2022-11-16 04:04:01,944 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:05:28,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:05:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-16 04:05:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-11-16 04:05:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-16 04:05:28,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 04:05:29,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 04:05:29,067 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:05:29,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:05:29,067 INFO L85 PathProgramCache]: Analyzing trace with hash -281078078, now seen corresponding path program 2 times [2022-11-16 04:05:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:05:29,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542674937] [2022-11-16 04:05:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:05:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:05:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:05:29,231 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:29,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:05:29,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542674937] [2022-11-16 04:05:29,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542674937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:05:29,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636256201] [2022-11-16 04:05:29,231 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 04:05:29,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:05:29,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:05:29,240 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:05:29,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 04:05:29,386 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 04:05:29,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:05:29,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-16 04:05:29,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:05:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:05:29,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:05:29,642 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-16 04:05:29,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636256201] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:05:29,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:05:29,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2022-11-16 04:05:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486006302] [2022-11-16 04:05:29,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:05:29,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-16 04:05:29,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:05:29,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-16 04:05:29,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2022-11-16 04:05:29,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:29,643 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:05:29,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.48) internal successors, (237), 25 states have internal predecessors, (237), 0 states have call successors, (0), 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-11-16 04:05:29,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:29,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:29,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 184 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 177 states. [2022-11-16 04:05:29,644 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:31,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-11-16 04:05:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-16 04:05:31,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 04:05:31,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-11-16 04:05:31,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-16 04:05:31,502 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:05:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:05:31,503 INFO L85 PathProgramCache]: Analyzing trace with hash 965606947, now seen corresponding path program 9 times [2022-11-16 04:05:31,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:05:31,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666945161] [2022-11-16 04:05:31,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:05:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:05:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:05:31,645 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:31,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:05:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666945161] [2022-11-16 04:05:31,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666945161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:05:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196553649] [2022-11-16 04:05:31,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 04:05:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:05:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:05:31,647 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:05:31,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 04:05:31,738 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-16 04:05:31,738 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:05:31,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 04:05:31,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:05:31,978 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:31,978 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:05:32,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:32,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196553649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 04:05:32,208 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 04:05:32,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 27 [2022-11-16 04:05:32,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766143062] [2022-11-16 04:05:32,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 04:05:32,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 04:05:32,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 04:05:32,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 04:05:32,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2022-11-16 04:05:32,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:32,209 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-16 04:05:32,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 8.222222222222221) internal successors, (222), 27 states have internal predecessors, (222), 0 states have call successors, (0), 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-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:05:32,209 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:32,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-11-16 04:05:32,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:32,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 184 states. [2022-11-16 04:05:32,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 177 states. [2022-11-16 04:05:32,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-16 04:05:32,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-16 04:05:32,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-16 04:05:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-16 04:05:32,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 04:05:33,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:05:33,112 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-16 04:05:33,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 04:05:33,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1541486618, now seen corresponding path program 10 times [2022-11-16 04:05:33,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 04:05:33,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764535230] [2022-11-16 04:05:33,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 04:05:33,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 04:05:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 04:05:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:35,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 04:05:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764535230] [2022-11-16 04:05:35,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764535230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 04:05:35,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856364437] [2022-11-16 04:05:35,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 04:05:35,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:05:35,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-16 04:05:35,697 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 04:05:35,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 04:05:35,794 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 04:05:35,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 04:05:35,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 04:05:35,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 04:05:37,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:05:37,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 87 [2022-11-16 04:05:39,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 04:05:39,187 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:05:39,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 164 treesize of output 108 [2022-11-16 04:05:40,406 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 04:05:40,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 04:06:25,159 WARN L233 SmtUtils]: Spent 33.02s on a formula simplification that was a NOOP. DAG size: 1652 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 04:06:25,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:25,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 30 select indices, 30 select index equivalence classes, 0 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 435 case distinctions, treesize of input 1980 treesize of output 6841 [2022-11-16 04:06:26,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:26,492 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1358 treesize of output 1325 [2022-11-16 04:06:27,553 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:27,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1325 treesize of output 1299 [2022-11-16 04:06:28,613 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:28,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1299 treesize of output 1286 [2022-11-16 04:06:29,679 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:29,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1286 treesize of output 1261 [2022-11-16 04:06:30,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:30,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1261 treesize of output 1234 [2022-11-16 04:06:31,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:31,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1234 treesize of output 1214 [2022-11-16 04:06:32,993 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:32,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1214 treesize of output 1183 [2022-11-16 04:06:34,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:34,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1183 treesize of output 1170 [2022-11-16 04:06:35,386 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:35,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1170 treesize of output 1137 [2022-11-16 04:06:37,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:37,062 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1137 treesize of output 1110 [2022-11-16 04:06:38,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:38,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1110 treesize of output 1085 [2022-11-16 04:06:39,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:39,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1085 treesize of output 1059 [2022-11-16 04:06:40,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:40,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1059 treesize of output 1039 [2022-11-16 04:06:42,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 04:06:42,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1039 treesize of output 1008 Received shutdown request... [2022-11-16 04:12:19,591 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-11-16 04:12:19,594 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-16 04:12:19,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:12:19,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:12:19,598 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-16 04:12:19,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-11-16 04:12:19,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 04:12:19,798 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 29ms.. [2022-11-16 04:12:19,800 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-16 04:12:19,800 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-16 04:12:19,800 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-16 04:12:19,806 INFO L444 BasicCegarLoop]: Path program histogram: [10, 3, 2, 2, 1, 1, 1] [2022-11-16 04:12:19,810 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-16 04:12:19,810 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 04:12:19,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 04:12:19 BasicIcfg [2022-11-16 04:12:19,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 04:12:19,813 INFO L158 Benchmark]: Toolchain (without parser) took 857574.78ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 131.9MB in the beginning and 855.7MB in the end (delta: -723.8MB). Peak memory consumption was 800.9MB. Max. memory is 8.0GB. [2022-11-16 04:12:19,814 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-16 04:12:19,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.90ms. Allocated memory is still 186.6MB. Free memory was 131.7MB in the beginning and 161.8MB in the end (delta: -30.1MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2022-11-16 04:12:19,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.10ms. Allocated memory is still 186.6MB. Free memory was 161.6MB in the beginning and 159.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 04:12:19,814 INFO L158 Benchmark]: Boogie Preprocessor took 25.60ms. Allocated memory is still 186.6MB. Free memory was 159.7MB in the beginning and 158.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-16 04:12:19,814 INFO L158 Benchmark]: RCFGBuilder took 401.49ms. Allocated memory is still 186.6MB. Free memory was 158.0MB in the beginning and 137.7MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-11-16 04:12:19,814 INFO L158 Benchmark]: TraceAbstraction took 856849.43ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 137.1MB in the beginning and 855.7MB in the end (delta: -718.6MB). Peak memory consumption was 805.9MB. Max. memory is 8.0GB. [2022-11-16 04:12:19,815 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 186.6MB. Free memory is still 148.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.90ms. Allocated memory is still 186.6MB. Free memory was 131.7MB in the beginning and 161.8MB in the end (delta: -30.1MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.10ms. Allocated memory is still 186.6MB. Free memory was 161.6MB in the beginning and 159.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.60ms. Allocated memory is still 186.6MB. Free memory was 159.7MB in the beginning and 158.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 401.49ms. Allocated memory is still 186.6MB. Free memory was 158.0MB in the beginning and 137.7MB in the end (delta: 20.3MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 856849.43ms. Allocated memory was 186.6MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 137.1MB in the beginning and 855.7MB in the end (delta: -718.6MB). Peak memory consumption was 805.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 145906, independent: 119936, independent conditional: 117606, independent unconditional: 2330, dependent: 25970, dependent conditional: 25952, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119959, independent: 119936, independent conditional: 117606, independent unconditional: 2330, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119959, independent: 119936, independent conditional: 117606, independent unconditional: 2330, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120126, independent: 119936, independent conditional: 35, independent unconditional: 119901, dependent: 190, dependent conditional: 132, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120126, independent: 119936, independent conditional: 35, independent unconditional: 119901, dependent: 190, dependent conditional: 94, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120126, independent: 119936, independent conditional: 35, independent unconditional: 119901, dependent: 190, dependent conditional: 94, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2030, independent: 1977, independent conditional: 7, independent unconditional: 1970, dependent: 53, dependent conditional: 35, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2030, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 53, dependent conditional: 35, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 53, dependent conditional: 35, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 49, independent conditional: 19, independent unconditional: 30, dependent: 181, dependent conditional: 104, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 120126, independent: 117959, independent conditional: 28, independent unconditional: 117931, dependent: 137, dependent conditional: 59, dependent unconditional: 78, unknown: 2030, unknown conditional: 42, unknown unconditional: 1988] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 1977, Positive conditional cache size: 7, Positive unconditional cache size: 1970, Negative cache size: 53, Negative conditional cache size: 35, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 17, Independence queries for same thread: 25947 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.3s, Number of persistent set computation: 1901, Number of trivial persistent sets: 1692, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2348, independent: 2330, independent conditional: 0, independent unconditional: 2330, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 145906, independent: 119936, independent conditional: 117606, independent unconditional: 2330, dependent: 25970, dependent conditional: 25952, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 119959, independent: 119936, independent conditional: 117606, independent unconditional: 2330, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 119959, independent: 119936, independent conditional: 117606, independent unconditional: 2330, dependent: 23, dependent conditional: 5, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 120126, independent: 119936, independent conditional: 35, independent unconditional: 119901, dependent: 190, dependent conditional: 132, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 120126, independent: 119936, independent conditional: 35, independent unconditional: 119901, dependent: 190, dependent conditional: 94, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 120126, independent: 119936, independent conditional: 35, independent unconditional: 119901, dependent: 190, dependent conditional: 94, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2030, independent: 1977, independent conditional: 7, independent unconditional: 1970, dependent: 53, dependent conditional: 35, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2030, independent: 1968, independent conditional: 0, independent unconditional: 1968, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 62, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 53, dependent conditional: 35, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 62, independent: 9, independent conditional: 7, independent unconditional: 2, dependent: 53, dependent conditional: 35, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 230, independent: 49, independent conditional: 19, independent unconditional: 30, dependent: 181, dependent conditional: 104, dependent unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 120126, independent: 117959, independent conditional: 28, independent unconditional: 117931, dependent: 137, dependent conditional: 59, dependent unconditional: 78, unknown: 2030, unknown conditional: 42, unknown unconditional: 1988] , Statistics on independence cache: Total cache size (in pairs): 2030, Positive cache size: 1977, Positive conditional cache size: 7, Positive unconditional cache size: 1970, Negative cache size: 53, Negative conditional cache size: 35, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 17, Independence queries for same thread: 25947 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 29ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 29ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 29ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 141 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 29ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 173 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 856.7s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 10, EmptinessCheckTime: 198.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1181, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 245.9s InterpolantComputationTime, 4664 NumberOfCodeBlocks, 4664 NumberOfCodeBlocksAsserted, 51 NumberOfCheckSat, 6835 ConstructedInterpolants, 106 QuantifiedInterpolants, 183561 SizeOfPredicates, 291 NumberOfNonLiveVariables, 5077 ConjunctsInSsa, 382 ConjunctsInUnsatCore, 53 InterpolantComputations, 4 PerfectInterpolantSequences, 302/651 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown