/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7707f89-m [2022-11-15 23:36:40,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-15 23:36:40,142 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-15 23:36:40,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-15 23:36:40,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-15 23:36:40,169 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-15 23:36:40,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-15 23:36:40,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-15 23:36:40,172 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-15 23:36:40,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-15 23:36:40,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-15 23:36:40,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-15 23:36:40,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-15 23:36:40,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-15 23:36:40,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-15 23:36:40,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-15 23:36:40,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-15 23:36:40,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-15 23:36:40,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-15 23:36:40,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-15 23:36:40,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-15 23:36:40,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-15 23:36:40,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-15 23:36:40,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-15 23:36:40,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-15 23:36:40,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-15 23:36:40,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-15 23:36:40,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-15 23:36:40,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-15 23:36:40,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-15 23:36:40,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-15 23:36:40,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-15 23:36:40,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-15 23:36:40,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-15 23:36:40,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-15 23:36:40,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-15 23:36:40,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-15 23:36:40,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-15 23:36:40,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-15 23:36:40,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-15 23:36:40,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-15 23:36:40,205 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-15 23:36:40,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-15 23:36:40,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-15 23:36:40,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-15 23:36:40,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-15 23:36:40,230 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-15 23:36:40,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-15 23:36:40,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-15 23:36:40,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-15 23:36:40,231 INFO L138 SettingsManager]: * Use SBE=true [2022-11-15 23:36:40,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-15 23:36:40,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-15 23:36:40,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-15 23:36:40,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 23:36:40,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-15 23:36:40,233 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-15 23:36:40,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-11-15 23:36:40,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-15 23:36:40,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-15 23:36:40,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-15 23:36:40,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-15 23:36:40,470 INFO L275 PluginConnector]: CDTParser initialized [2022-11-15 23:36:40,471 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-11-15 23:36:40,514 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f95615c8/1cb8f587c6834ed2ad1d14f68895edc1/FLAG763c235d4 [2022-11-15 23:36:40,899 INFO L306 CDTParser]: Found 1 translation units. [2022-11-15 23:36:40,899 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-11-15 23:36:40,910 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f95615c8/1cb8f587c6834ed2ad1d14f68895edc1/FLAG763c235d4 [2022-11-15 23:36:40,922 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f95615c8/1cb8f587c6834ed2ad1d14f68895edc1 [2022-11-15 23:36:40,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-15 23:36:40,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-15 23:36:40,943 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-15 23:36:40,943 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-15 23:36:40,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-15 23:36:40,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:40" (1/1) ... [2022-11-15 23:36:40,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27613317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:40, skipping insertion in model container [2022-11-15 23:36:40,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:36:40" (1/1) ... [2022-11-15 23:36:40,953 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-15 23:36:40,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-15 23:36:41,123 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.wvr.c[2553,2566] [2022-11-15 23:36:41,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 23:36:41,140 INFO L203 MainTranslator]: Completed pre-run [2022-11-15 23:36:41,169 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.wvr.c[2553,2566] [2022-11-15 23:36:41,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-15 23:36:41,181 INFO L208 MainTranslator]: Completed translation [2022-11-15 23:36:41,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41 WrapperNode [2022-11-15 23:36:41,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-15 23:36:41,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-15 23:36:41,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-15 23:36:41,182 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-15 23:36:41,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,199 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,219 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-11-15 23:36:41,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-15 23:36:41,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-15 23:36:41,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-15 23:36:41,220 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-15 23:36:41,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,237 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,237 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,246 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,249 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,251 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-15 23:36:41,252 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-15 23:36:41,252 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-15 23:36:41,252 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-15 23:36:41,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (1/1) ... [2022-11-15 23:36:41,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-15 23:36:41,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:41,310 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-15 23:36:41,332 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-15 23:36:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-15 23:36:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-15 23:36:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-15 23:36:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-15 23:36:41,337 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-15 23:36:41,337 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-15 23:36:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-15 23:36:41,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-15 23:36:41,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-15 23:36:41,339 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-15 23:36:41,406 INFO L235 CfgBuilder]: Building ICFG [2022-11-15 23:36:41,408 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-15 23:36:41,636 INFO L276 CfgBuilder]: Performing block encoding [2022-11-15 23:36:41,708 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-15 23:36:41,708 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-15 23:36:41,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:41 BoogieIcfgContainer [2022-11-15 23:36:41,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-15 23:36:41,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-15 23:36:41,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-15 23:36:41,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-15 23:36:41,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:36:40" (1/3) ... [2022-11-15 23:36:41,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1f0ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:41, skipping insertion in model container [2022-11-15 23:36:41,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:36:41" (2/3) ... [2022-11-15 23:36:41,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1f0ca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:36:41, skipping insertion in model container [2022-11-15 23:36:41,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:36:41" (3/3) ... [2022-11-15 23:36:41,718 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-11-15 23:36:41,723 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-15 23:36:41,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-15 23:36:41,729 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-15 23:36:41,729 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-15 23:36:41,803 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-15 23:36:41,838 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 23:36:41,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-15 23:36:41,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:41,841 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-15 23:36:41,842 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-15 23:36:41,863 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-15 23:36:41,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2022-11-15 23:36:41,874 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;@2971acbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-15 23:36:41,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-15 23:36:41,995 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-15 23:36:41,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:41,999 INFO L85 PathProgramCache]: Analyzing trace with hash -990075498, now seen corresponding path program 1 times [2022-11-15 23:36:42,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:42,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209062421] [2022-11-15 23:36:42,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:42,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:42,227 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-15 23:36:42,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:42,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209062421] [2022-11-15 23:36:42,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209062421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 23:36:42,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 23:36:42,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-15 23:36:42,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379200666] [2022-11-15 23:36:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:42,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-15 23:36:42,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:42,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-15 23:36:42,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-15 23:36:42,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:42,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.5) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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-15 23:36:42,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-15 23:36:42,295 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-15 23:36:42,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:42,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1421486002, now seen corresponding path program 1 times [2022-11-15 23:36:42,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:42,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486064678] [2022-11-15 23:36:42,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:42,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:42,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:42,717 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-15 23:36:42,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:42,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486064678] [2022-11-15 23:36:42,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486064678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-15 23:36:42,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-15 23:36:42,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-15 23:36:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289978670] [2022-11-15 23:36:42,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:42,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-15 23:36:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:42,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-15 23:36:42,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-15 23:36:42,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,720 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:42,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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-15 23:36:42,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:42,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-15 23:36:42,925 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-15 23:36:42,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1997378296, now seen corresponding path program 1 times [2022-11-15 23:36:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:42,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532759239] [2022-11-15 23:36:42,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:42,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:43,131 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-15 23:36:43,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:43,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532759239] [2022-11-15 23:36:43,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532759239] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:43,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001506408] [2022-11-15 23:36:43,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:43,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:43,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:43,158 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-15 23:36:43,187 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-15 23:36:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:43,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-15 23:36:43,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:43,446 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-15 23:36:43,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:43,601 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-15 23:36:43,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001506408] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:43,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-15 23:36:43,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-15 23:36:43,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414056776] [2022-11-15 23:36:43,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:43,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-15 23:36:43,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:43,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-15 23:36:43,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-15 23:36:43,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:43,604 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:43,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.0) internal successors, (112), 7 states have internal predecessors, (112), 0 states have call successors, (0), 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-15 23:36:43,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:43,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:43,604 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:43,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:43,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:43,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-15 23:36:43,915 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-15 23:36:43,916 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-15 23:36:43,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:43,916 INFO L85 PathProgramCache]: Analyzing trace with hash -488176783, now seen corresponding path program 1 times [2022-11-15 23:36:43,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:43,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870330744] [2022-11-15 23:36:43,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:44,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:44,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870330744] [2022-11-15 23:36:44,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870330744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:44,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230459619] [2022-11-15 23:36:44,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:44,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:44,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:44,133 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-15 23:36:44,134 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-15 23:36:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:44,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-15 23:36:44,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:44,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:44,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230459619] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:44,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-15 23:36:44,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-15 23:36:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68459979] [2022-11-15 23:36:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-15 23:36:44,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-15 23:36:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:44,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-15 23:36:44,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2022-11-15 23:36:44,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:44,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:44,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.0) internal successors, (117), 9 states have internal predecessors, (117), 0 states have call successors, (0), 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-15 23:36:44,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:44,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:44,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:44,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:44,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:44,619 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-15 23:36:44,816 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-15 23:36:44,817 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-15 23:36:44,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:44,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1789324920, now seen corresponding path program 1 times [2022-11-15 23:36:44,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:44,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216899936] [2022-11-15 23:36:44,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:44,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:45,939 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-15 23:36:45,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:45,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216899936] [2022-11-15 23:36:45,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216899936] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:45,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636911986] [2022-11-15 23:36:45,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:45,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:45,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:45,941 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-15 23:36:45,981 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-15 23:36:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:46,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-11-15 23:36:46,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:47,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:36:47,131 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:47,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-11-15 23:36:47,210 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-15 23:36:47,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:47,435 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:47,436 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 87 treesize of output 51 [2022-11-15 23:36:47,954 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-15 23:36:47,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636911986] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:47,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:47,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 24, 18] total 57 [2022-11-15 23:36:47,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973747786] [2022-11-15 23:36:47,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:47,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-11-15 23:36:47,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:47,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-11-15 23:36:47,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=476, Invalid=2716, Unknown=0, NotChecked=0, Total=3192 [2022-11-15 23:36:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:47,956 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:47,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.491228070175438) internal successors, (313), 57 states have internal predecessors, (313), 0 states have call successors, (0), 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-15 23:36:47,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:47,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:47,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:47,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:47,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:50,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:50,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:36:50,210 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-15 23:36:50,394 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-15 23:36:50,395 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-15 23:36:50,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:50,395 INFO L85 PathProgramCache]: Analyzing trace with hash -250359855, now seen corresponding path program 2 times [2022-11-15 23:36:50,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:50,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831051094] [2022-11-15 23:36:50,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:50,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:50,663 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-15 23:36:50,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:50,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831051094] [2022-11-15 23:36:50,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831051094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:50,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587472230] [2022-11-15 23:36:50,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-15 23:36:50,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:50,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:50,665 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-15 23:36:50,667 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-15 23:36:50,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 23:36:50,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:36:50,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-15 23:36:50,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:51,129 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-15 23:36:51,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:51,365 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-15 23:36:51,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587472230] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:51,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:51,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2022-11-15 23:36:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497154721] [2022-11-15 23:36:51,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:51,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-15 23:36:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:51,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-15 23:36:51,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=723, Unknown=0, NotChecked=0, Total=870 [2022-11-15 23:36:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:51,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:51,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.266666666666667) internal successors, (218), 30 states have internal predecessors, (218), 0 states have call successors, (0), 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-15 23:36:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:36:51,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:36:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:36:52,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:52,113 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-15 23:36:52,299 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-15 23:36:52,300 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-15 23:36:52,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:52,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1892771466, now seen corresponding path program 1 times [2022-11-15 23:36:52,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:52,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224166043] [2022-11-15 23:36:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:52,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224166043] [2022-11-15 23:36:52,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224166043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:52,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8074135] [2022-11-15 23:36:52,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:52,506 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-15 23:36:52,551 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-15 23:36:52,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:52,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-15 23:36:52,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:52,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:52,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:53,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8074135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:53,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:53,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-11-15 23:36:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845668256] [2022-11-15 23:36:53,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:53,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-15 23:36:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-15 23:36:53,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2022-11-15 23:36:53,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:53,099 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:53,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.518518518518518) internal successors, (203), 27 states have internal predecessors, (203), 0 states have call successors, (0), 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-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2022-11-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:53,100 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:53,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:36:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-15 23:36:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:53,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:36:53,681 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-15 23:36:53,879 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-15 23:36:53,879 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-15 23:36:53,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -165325407, now seen corresponding path program 3 times [2022-11-15 23:36:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:53,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769129272] [2022-11-15 23:36:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:54,023 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-15 23:36:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:54,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769129272] [2022-11-15 23:36:54,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769129272] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:54,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578341781] [2022-11-15 23:36:54,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-15 23:36:54,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:54,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:54,025 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-15 23:36:54,027 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-15 23:36:54,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-15 23:36:54,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:36:54,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-15 23:36:54,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:54,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:54,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:36:54,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578341781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:36:54,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:36:54,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-11-15 23:36:54,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50009932] [2022-11-15 23:36:54,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:36:54,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-15 23:36:54,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:36:54,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-15 23:36:54,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-15 23:36:54,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:54,347 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:36:54,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.2) internal successors, (230), 25 states have internal predecessors, (230), 0 states have call successors, (0), 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-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:36:54,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:36:55,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:36:55,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-15 23:36:55,603 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-15 23:36:55,604 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-15 23:36:55,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:36:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1516468592, now seen corresponding path program 4 times [2022-11-15 23:36:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:36:55,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493734913] [2022-11-15 23:36:55,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:36:55,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:36:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:36:56,701 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-15 23:36:56,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:36:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493734913] [2022-11-15 23:36:56,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493734913] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:36:56,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162384402] [2022-11-15 23:36:56,702 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-15 23:36:56,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:36:56,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:36:56,703 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-15 23:36:56,707 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-15 23:36:56,785 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-15 23:36:56,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:36:56,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-15 23:36:56,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:36:57,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-15 23:36:57,740 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-15 23:36:58,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:58,057 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-15 23:36:58,449 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-15 23:36:58,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:36:59,055 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:36:59,055 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 161 treesize of output 149 [2022-11-15 23:36:59,063 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 90 treesize of output 84 [2022-11-15 23:36:59,067 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 84 treesize of output 72 [2022-11-15 23:37:00,307 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-15 23:37:00,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162384402] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:37:00,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:37:00,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 27] total 67 [2022-11-15 23:37:00,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974085537] [2022-11-15 23:37:00,308 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:37:00,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-15 23:37:00,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:37:00,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-15 23:37:00,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=3933, Unknown=10, NotChecked=0, Total=4422 [2022-11-15 23:37:00,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:00,310 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:37:00,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 4.507462686567164) internal successors, (302), 67 states have internal predecessors, (302), 0 states have call successors, (0), 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-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:37:00,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:37:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:02,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-11-15 23:37:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:37:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:37:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:37:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-15 23:37:02,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-15 23:37:03,079 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-15 23:37:03,080 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-15 23:37:03,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:37:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1420844820, now seen corresponding path program 5 times [2022-11-15 23:37:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:37:03,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708476598] [2022-11-15 23:37:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:37:03,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:37:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:37:04,266 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-15 23:37:04,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:37:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708476598] [2022-11-15 23:37:04,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708476598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:37:04,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212064574] [2022-11-15 23:37:04,267 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-15 23:37:04,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:37:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:37:04,268 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-15 23:37:04,270 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-15 23:37:04,343 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-15 23:37:04,343 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:37:04,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-15 23:37:04,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:37:04,390 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-15 23:37:04,425 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-15 23:37:04,425 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 14 [2022-11-15 23:37:04,703 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-15 23:37:04,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 16 treesize of output 18 [2022-11-15 23:37:04,858 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 15 treesize of output 11 [2022-11-15 23:37:05,252 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-15 23:37:05,458 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-15 23:37:05,582 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-15 23:37:05,927 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:05,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 43 [2022-11-15 23:37:06,211 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-15 23:37:06,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:37:06,678 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= c_~min1~0 .cse0) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse0 c_~min2~0))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))))) is different from false [2022-11-15 23:37:09,544 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~min1~0) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse1) (not (< .cse1 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min2~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (< (select (select .cse3 c_~A~0.base) c_~A~0.offset) c_~min1~0) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse4 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse4))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse6 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< .cse5 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (= .cse5 .cse6) (not (< ~M~0 c_~N~0))))) (not (< .cse6 c_~min1~0)))))))) is different from false [2022-11-15 23:37:10,139 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse0 |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_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) c_~min2~0))) (not (< .cse1 c_~min1~0)) (= c_~min2~0 .cse1))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (not (< .cse2 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (= .cse2 .cse3) (<= (+ 2 ~M~0) c_~N~0) (not (< .cse3 c_~min2~0)) (not (< ~M~0 c_~N~0))))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< .cse5 c_~min2~0)) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse5)))) (< (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0)))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))) 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)))))) (not (< 0 c_~N~0))) is different from false [2022-11-15 23:37:10,251 WARN L833 $PredicateComparison]: unable to prove that (or (not (< 0 c_~N~0)) (and (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (< (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse1) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) c_~min2~0))) (not (< .cse1 c_~min1~0)))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse3 c_~min2~0)) (= c_~min1~0 .cse3)))) (< (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (not (< .cse5 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse5 .cse6) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (not (< .cse6 c_~min2~0))))))))))) is different from false [2022-11-15 23:37:10,311 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (= c_~min2~0 .cse0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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_~min2~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse2 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse3 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= .cse3 .cse2)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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_~min2~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse6 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse6)))) (< (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))))) (not (< 0 c_~N~0))) is different from false [2022-11-15 23:37:10,411 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse0 c_~min1~0)) (= c_~min2~0 .cse0) (forall ((v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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_~min2~0))))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< .cse2 c_~min1~0)) (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse3 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= .cse3 .cse2)))))))) (or (= c_~min2~0 c_~min1~0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_292 (Array Int Int)) (~M~0 Int) (v_ArrVal_291 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |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_~min2~0) (< (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0))))) (forall ((v_ArrVal_290 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_290))) (or (forall ((v_ArrVal_292 (Array Int Int)) (v_ArrVal_291 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_291) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_292) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< .cse6 c_~min2~0)) (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (= c_~min1~0 .cse6)))) (< (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))))) (not (< 0 c_~N~0)) (< |c_ULTIMATE.start_create_fresh_int_array_~i~3#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) is different from false [2022-11-15 23:37:11,005 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:11,006 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-15 23:37:11,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:11,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 317 treesize of output 307 [2022-11-15 23:37:11,019 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 280 treesize of output 232 [2022-11-15 23:37:11,024 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 232 treesize of output 208 [2022-11-15 23:37:11,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:11,034 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 170 treesize of output 166 [2022-11-15 23:37:11,334 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:11,334 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 78 treesize of output 54 [2022-11-15 23:37:11,337 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:37:11,338 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:37:11,343 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-15 23:37:11,344 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 75 treesize of output 63 [2022-11-15 23:37:11,352 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-15 23:37:11,352 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 43 treesize of output 37 [2022-11-15 23:37:11,402 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-15 23:37:11,403 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 108 treesize of output 1 [2022-11-15 23:37:11,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:11,409 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-15 23:37:11,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:37:11,412 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-15 23:37:11,418 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-15 23:37:11,419 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-15 23:37:11,426 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-15 23:37:11,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-11-15 23:37:12,321 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 13 treesize of output 11 [2022-11-15 23:37:12,331 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-15 23:37:12,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [212064574] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:37:12,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:37:12,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 75 [2022-11-15 23:37:12,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683750969] [2022-11-15 23:37:12,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:37:12,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-11-15 23:37:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:37:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-11-15 23:37:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=4161, Unknown=40, NotChecked=834, Total=5550 [2022-11-15 23:37:12,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:12,334 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:37:12,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 4.053333333333334) internal successors, (304), 75 states have internal predecessors, (304), 0 states have call successors, (0), 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-15 23:37:12,335 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 52 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-15 23:37:12,347 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-11-15 23:37:12,348 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:37:25,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-15 23:37:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-15 23:37:25,494 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-15 23:37:25,683 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-15 23:37:25,684 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-15 23:37:25,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:37:25,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2006761502, now seen corresponding path program 6 times [2022-11-15 23:37:25,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:37:25,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562860421] [2022-11-15 23:37:25,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:37:25,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:37:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:37:25,818 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:37:25,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:37:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562860421] [2022-11-15 23:37:25,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562860421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:37:25,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365134924] [2022-11-15 23:37:25,819 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-15 23:37:25,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:37:25,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:37:25,820 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-15 23:37:25,827 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-15 23:37:25,905 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-11-15 23:37:25,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-15 23:37:25,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-15 23:37:25,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:37:26,087 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:37:26,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:37:26,304 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-15 23:37:26,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365134924] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-15 23:37:26,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-15 23:37:26,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 29 [2022-11-15 23:37:26,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553398283] [2022-11-15 23:37:26,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-15 23:37:26,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-15 23:37:26,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-15 23:37:26,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-15 23:37:26,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=676, Unknown=0, NotChecked=0, Total=812 [2022-11-15 23:37:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:26,306 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-15 23:37:26,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 7.103448275862069) internal successors, (206), 29 states have internal predecessors, (206), 0 states have call successors, (0), 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-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 53 states. [2022-11-15 23:37:26,306 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-11-15 23:37:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-11-15 23:37:27,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-15 23:37:27,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-15 23:37:27,412 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-15 23:37:27,413 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-15 23:37:27,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-15 23:37:27,413 INFO L85 PathProgramCache]: Analyzing trace with hash 326209330, now seen corresponding path program 7 times [2022-11-15 23:37:27,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-15 23:37:27,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016060719] [2022-11-15 23:37:27,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-15 23:37:27,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-15 23:37:27,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:37:29,898 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-15 23:37:29,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-15 23:37:29,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016060719] [2022-11-15 23:37:29,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016060719] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-15 23:37:29,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181337495] [2022-11-15 23:37:29,899 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-15 23:37:29,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-15 23:37:29,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-15 23:37:29,900 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-15 23:37:29,902 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-15 23:37:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-15 23:37:30,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-15 23:37:30,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-15 23:37:31,804 INFO L321 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2022-11-15 23:37:31,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 177 treesize of output 108 [2022-11-15 23:37:32,508 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-15 23:37:32,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-15 23:37:50,870 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-15 23:37:50,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 153 case distinctions, treesize of input 485 treesize of output 2059 [2022-11-15 23:38:34,449 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-11-15 23:38:46,666 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-15 23:39:04,867 WARN L233 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 653 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:39:21,529 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-15 23:39:54,610 WARN L233 SmtUtils]: Spent 6.82s on a formula simplification. DAG size of input: 672 DAG size of output: 514 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:40:10,964 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-15 23:40:29,189 WARN L233 SmtUtils]: Spent 6.32s on a formula simplification. DAG size of input: 655 DAG size of output: 514 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:40:45,421 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-15 23:41:03,542 WARN L233 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 653 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:41:17,433 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-15 23:41:57,975 WARN L233 SmtUtils]: Spent 14.32s on a formula simplification. DAG size of input: 870 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:42:28,940 WARN L718 sPolynomialRelations]: Constructing 524288(two to the power of 19 dual juncts. [2022-11-15 23:43:34,195 WARN L233 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 688 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:43:50,322 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-15 23:44:15,786 WARN L233 SmtUtils]: Spent 13.56s on a formula simplification. DAG size of input: 853 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:44:46,492 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-15 23:45:19,588 WARN L233 SmtUtils]: Spent 6.90s on a formula simplification. DAG size of input: 671 DAG size of output: 513 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:45:35,963 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-15 23:45:54,181 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 652 DAG size of output: 512 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:46:11,490 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-15 23:46:53,729 WARN L233 SmtUtils]: Spent 30.42s on a formula simplification. DAG size of input: 1144 DAG size of output: 1027 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:47:53,537 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-11-15 23:48:27,540 WARN L233 SmtUtils]: Spent 28.67s on a formula simplification. DAG size of input: 1127 DAG size of output: 1027 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:49:27,167 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-15 23:50:07,945 WARN L233 SmtUtils]: Spent 14.50s on a formula simplification. DAG size of input: 870 DAG size of output: 722 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-15 23:50:38,901 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. Received shutdown request... [2022-11-15 23:50:50,185 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-15 23:50:50,187 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-15 23:50:50,188 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-15 23:50:50,239 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-11-15 23:50:50,242 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-11-15 23:50:50,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-15 23:50:50,447 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-15 23:50:50,448 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-576-73-1 term,while PolyPacSimplificationTermWalker was simplifying 69 xjuncts wrt. a ∧-575-72-1 context. [2022-11-15 23:50:50,449 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-11-15 23:50:50,449 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-11-15 23:50:50,449 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-11-15 23:50:50,452 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1] [2022-11-15 23:50:50,453 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-15 23:50:50,453 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-15 23:50:50,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:50:50 BasicIcfg [2022-11-15 23:50:50,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-15 23:50:50,455 INFO L158 Benchmark]: Toolchain (without parser) took 849530.54ms. Allocated memory was 211.8MB in the beginning and 834.7MB in the end (delta: 622.9MB). Free memory was 151.7MB in the beginning and 567.0MB in the end (delta: -415.3MB). Peak memory consumption was 546.4MB. Max. memory is 8.0GB. [2022-11-15 23:50:50,455 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 211.8MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-15 23:50:50,456 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.55ms. Allocated memory was 211.8MB in the beginning and 272.6MB in the end (delta: 60.8MB). Free memory was 185.8MB in the beginning and 242.0MB in the end (delta: -56.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-11-15 23:50:50,456 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.70ms. Allocated memory is still 272.6MB. Free memory was 241.9MB in the beginning and 239.9MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-11-15 23:50:50,456 INFO L158 Benchmark]: Boogie Preprocessor took 31.21ms. Allocated memory is still 272.6MB. Free memory was 239.9MB in the beginning and 238.3MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-15 23:50:50,456 INFO L158 Benchmark]: RCFGBuilder took 458.34ms. Allocated memory is still 272.6MB. Free memory was 238.3MB in the beginning and 217.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2022-11-15 23:50:50,456 INFO L158 Benchmark]: TraceAbstraction took 848743.61ms. Allocated memory was 272.6MB in the beginning and 834.7MB in the end (delta: 562.0MB). Free memory was 216.8MB in the beginning and 567.0MB in the end (delta: -350.2MB). Peak memory consumption was 550.6MB. Max. memory is 8.0GB. [2022-11-15 23:50:50,457 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 211.8MB. Free memory is still 168.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.55ms. Allocated memory was 211.8MB in the beginning and 272.6MB in the end (delta: 60.8MB). Free memory was 185.8MB in the beginning and 242.0MB in the end (delta: -56.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.70ms. Allocated memory is still 272.6MB. Free memory was 241.9MB in the beginning and 239.9MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.21ms. Allocated memory is still 272.6MB. Free memory was 239.9MB in the beginning and 238.3MB in the end (delta: 1.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 458.34ms. Allocated memory is still 272.6MB. Free memory was 238.3MB in the beginning and 217.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 848743.61ms. Allocated memory was 272.6MB in the beginning and 834.7MB in the end (delta: 562.0MB). Free memory was 216.8MB in the beginning and 567.0MB in the end (delta: -350.2MB). Peak memory consumption was 550.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43590, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 5603, dependent conditional: 5583, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 17, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1978, independent: 1949, independent conditional: 3, independent unconditional: 1946, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1978, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 49, independent conditional: 18, independent unconditional: 31, dependent: 78, dependent conditional: 24, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 38031, independent: 36038, independent conditional: 2, independent unconditional: 36036, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1978, unknown conditional: 12, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1949, Positive conditional cache size: 3, Positive unconditional cache size: 1946, Negative cache size: 29, Negative conditional cache size: 9, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5581 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 1755, Number of trivial persistent sets: 1738, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2222, independent: 2202, independent conditional: 0, independent unconditional: 2202, dependent: 20, dependent conditional: 0, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43590, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 5603, dependent conditional: 5583, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 38009, independent: 37987, independent conditional: 35785, independent unconditional: 2202, dependent: 22, dependent conditional: 2, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 17, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 38031, independent: 37987, independent conditional: 5, independent unconditional: 37982, dependent: 44, dependent conditional: 9, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1978, independent: 1949, independent conditional: 3, independent unconditional: 1946, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1978, independent: 1944, independent conditional: 0, independent unconditional: 1944, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 34, independent: 5, independent conditional: 3, independent unconditional: 2, dependent: 29, dependent conditional: 9, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 49, independent conditional: 18, independent unconditional: 31, dependent: 78, dependent conditional: 24, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 38031, independent: 36038, independent conditional: 2, independent unconditional: 36036, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 1978, unknown conditional: 12, unknown unconditional: 1966] , Statistics on independence cache: Total cache size (in pairs): 1978, Positive cache size: 1949, Positive conditional cache size: 3, Positive unconditional cache size: 1946, Negative cache size: 29, Negative conditional cache size: 9, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 8, Maximal queried relation: 8, Independence queries for same thread: 5581 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-576-73-1 term,while PolyPacSimplificationTermWalker was simplifying 69 xjuncts wrt. a ∧-575-72-1 context. - 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 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-576-73-1 term,while PolyPacSimplificationTermWalker was simplifying 69 xjuncts wrt. a ∧-575-72-1 context. - 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 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-576-73-1 term,while PolyPacSimplificationTermWalker was simplifying 69 xjuncts wrt. a ∧-575-72-1 context. - 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 140 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-576-73-1 term,while PolyPacSimplificationTermWalker was simplifying 69 xjuncts wrt. a ∧-575-72-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 172 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 848.6s, OverallIterations: 12, TraceHistogramMax: 0, PathProgramHistogramMax: 7, EmptinessCheckTime: 21.8s, 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: 301, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 20.4s InterpolantComputationTime, 2414 NumberOfCodeBlocks, 2414 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3485 ConstructedInterpolants, 102 QuantifiedInterpolants, 35713 SizeOfPredicates, 155 NumberOfNonLiveVariables, 2562 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 29 InterpolantComputations, 4 PerfectInterpolantSequences, 59/132 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