/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 05:42:08,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 05:42:08,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 05:42:08,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 05:42:08,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 05:42:08,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 05:42:08,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 05:42:08,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 05:42:08,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 05:42:08,235 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 05:42:08,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 05:42:08,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 05:42:08,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 05:42:08,239 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 05:42:08,240 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 05:42:08,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 05:42:08,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 05:42:08,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 05:42:08,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 05:42:08,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 05:42:08,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 05:42:08,251 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 05:42:08,251 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 05:42:08,252 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 05:42:08,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 05:42:08,254 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 05:42:08,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 05:42:08,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 05:42:08,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 05:42:08,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 05:42:08,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 05:42:08,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 05:42:08,256 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 05:42:08,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 05:42:08,257 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 05:42:08,257 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 05:42:08,258 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 05:42:08,258 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 05:42:08,258 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 05:42:08,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 05:42:08,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 05:42:08,261 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 05:42:08,280 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 05:42:08,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 05:42:08,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 05:42:08,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 05:42:08,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 05:42:08,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 05:42:08,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 05:42:08,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 05:42:08,284 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 05:42:08,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 05:42:08,284 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 05:42:08,285 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 05:42:08,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 05:42:08,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 05:42:08,286 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 05:42:08,287 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 05:42:08,287 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 05:42:08,287 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 05:42:08,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 05:42:08,287 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 05:42:08,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-20 05:42:08,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 05:42:08,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 05:42:08,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 05:42:08,505 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 05:42:08,506 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 05:42:08,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2023-05-20 05:42:08,556 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7162fa6/9c39a4843f1e4d828ad35986dfffbeaa/FLAGc24cb2ce2 [2023-05-20 05:42:08,914 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 05:42:08,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c [2023-05-20 05:42:08,937 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7162fa6/9c39a4843f1e4d828ad35986dfffbeaa/FLAGc24cb2ce2 [2023-05-20 05:42:08,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d7162fa6/9c39a4843f1e4d828ad35986dfffbeaa [2023-05-20 05:42:08,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 05:42:08,950 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 05:42:08,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 05:42:08,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 05:42:08,953 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 05:42:08,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 05:42:08" (1/1) ... [2023-05-20 05:42:08,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a89903f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:08, skipping insertion in model container [2023-05-20 05:42:08,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 05:42:08" (1/1) ... [2023-05-20 05:42:08,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 05:42:08,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 05:42:09,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2023-05-20 05:42:09,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 05:42:09,177 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 05:42:09,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-buffer-series2.wvr.c[4232,4245] [2023-05-20 05:42:09,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 05:42:09,224 INFO L208 MainTranslator]: Completed translation [2023-05-20 05:42:09,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09 WrapperNode [2023-05-20 05:42:09,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 05:42:09,225 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 05:42:09,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 05:42:09,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 05:42:09,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,280 INFO L138 Inliner]: procedures = 27, calls = 83, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 346 [2023-05-20 05:42:09,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 05:42:09,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 05:42:09,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 05:42:09,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 05:42:09,288 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,310 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,326 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,334 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 05:42:09,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 05:42:09,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 05:42:09,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 05:42:09,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (1/1) ... [2023-05-20 05:42:09,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 05:42:09,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:42:09,358 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-05-20 05:42:09,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-05-20 05:42:09,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 05:42:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 05:42:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 05:42:09,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 05:42:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 05:42:09,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 05:42:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 05:42:09,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 05:42:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-20 05:42:09,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-20 05:42:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-05-20 05:42:09,413 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-05-20 05:42:09,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 05:42:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-20 05:42:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-20 05:42:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 05:42:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 05:42:09,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 05:42:09,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 05:42:09,415 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-20 05:42:09,554 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 05:42:09,555 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 05:42:09,935 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 05:42:10,072 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 05:42:10,073 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2023-05-20 05:42:10,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 05:42:10 BoogieIcfgContainer [2023-05-20 05:42:10,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 05:42:10,076 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 05:42:10,076 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 05:42:10,085 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 05:42:10,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 05:42:08" (1/3) ... [2023-05-20 05:42:10,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f78c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 05:42:10, skipping insertion in model container [2023-05-20 05:42:10,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 05:42:09" (2/3) ... [2023-05-20 05:42:10,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f78c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 05:42:10, skipping insertion in model container [2023-05-20 05:42:10,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 05:42:10" (3/3) ... [2023-05-20 05:42:10,091 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-buffer-series2.wvr.c [2023-05-20 05:42:10,096 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 05:42:10,104 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 05:42:10,104 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 05:42:10,104 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 05:42:10,186 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-05-20 05:42:10,224 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 05:42:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 05:42:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:42:10,234 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) [2023-05-20 05:42:10,237 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 [2023-05-20 05:42:10,257 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 05:42:10,268 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 05:42:10,272 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;@13bc0486, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 05:42:10,272 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-05-20 05:42:10,463 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 2 more)] === [2023-05-20 05:42:10,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash 411686062, now seen corresponding path program 1 times [2023-05-20 05:42:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189638563] [2023-05-20 05:42:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:10,797 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-05-20 05:42:10,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:10,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189638563] [2023-05-20 05:42:10,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189638563] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:10,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:10,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 05:42:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560070359] [2023-05-20 05:42:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:10,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 05:42:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:10,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 05:42:10,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 05:42:10,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:10,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:10,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:10,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:10,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:10,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 05:42:10,886 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 2 more)] === [2023-05-20 05:42:10,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1183665063, now seen corresponding path program 1 times [2023-05-20 05:42:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:10,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266417005] [2023-05-20 05:42:10,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 05:42:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:11,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266417005] [2023-05-20 05:42:11,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266417005] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:11,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:11,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-05-20 05:42:11,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322731941] [2023-05-20 05:42:11,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:11,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-05-20 05:42:11,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:11,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-05-20 05:42:11,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-05-20 05:42:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,243 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:11,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:11,243 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,244 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:11,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 05:42:11,297 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 2 more)] === [2023-05-20 05:42:11,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:11,299 INFO L85 PathProgramCache]: Analyzing trace with hash 394136066, now seen corresponding path program 1 times [2023-05-20 05:42:11,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:11,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614328117] [2023-05-20 05:42:11,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:11,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:11,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-05-20 05:42:11,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:11,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614328117] [2023-05-20 05:42:11,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614328117] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:11,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:11,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-20 05:42:11,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562541634] [2023-05-20 05:42:11,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:11,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-20 05:42:11,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:11,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-20 05:42:11,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 05:42:11,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,540 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:11,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.833333333333336) internal successors, (197), 6 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:11,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:11,540 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:11,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:11,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:11,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-05-20 05:42:11,632 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 2 more)] === [2023-05-20 05:42:11,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:11,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1362985461, now seen corresponding path program 1 times [2023-05-20 05:42:11,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:11,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983301363] [2023-05-20 05:42:11,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:11,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:11,919 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:42:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:11,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983301363] [2023-05-20 05:42:11,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983301363] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 05:42:11,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985102612] [2023-05-20 05:42:11,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:11,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:42:11,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:42:11,957 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 05:42:11,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-05-20 05:42:12,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:12,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 9 conjunts are in the unsatisfiable core [2023-05-20 05:42:12,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 05:42:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:42:12,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 05:42:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:42:12,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985102612] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 05:42:12,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 05:42:12,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-05-20 05:42:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214625670] [2023-05-20 05:42:12,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 05:42:12,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-05-20 05:42:12,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-05-20 05:42:12,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-05-20 05:42:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:12,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:12,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 15.263157894736842) internal successors, (290), 19 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:12,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:12,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:12,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:12,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:12,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:12,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-20 05:42:13,107 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,SelfDestructingSolverStorable3 [2023-05-20 05:42:13,108 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 2 more)] === [2023-05-20 05:42:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:13,108 INFO L85 PathProgramCache]: Analyzing trace with hash -767681054, now seen corresponding path program 2 times [2023-05-20 05:42:13,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:13,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579763637] [2023-05-20 05:42:13,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:13,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-05-20 05:42:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:13,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579763637] [2023-05-20 05:42:13,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579763637] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:13,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:13,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-05-20 05:42:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473495211] [2023-05-20 05:42:13,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:13,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-05-20 05:42:13,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:13,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-05-20 05:42:13,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-05-20 05:42:13,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:13,419 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:13,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 25.375) internal successors, (203), 8 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) [2023-05-20 05:42:13,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:13,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:13,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:13,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:13,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:13,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:13,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:13,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 05:42:13,541 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 2 more)] === [2023-05-20 05:42:13,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:13,542 INFO L85 PathProgramCache]: Analyzing trace with hash 264277528, now seen corresponding path program 1 times [2023-05-20 05:42:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:13,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959041902] [2023-05-20 05:42:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:13,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-20 05:42:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:13,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959041902] [2023-05-20 05:42:13,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959041902] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:13,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:13,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-05-20 05:42:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943053873] [2023-05-20 05:42:13,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:13,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-05-20 05:42:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:13,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-05-20 05:42:13,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-05-20 05:42:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:13,904 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 23.444444444444443) internal successors, (211), 9 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:13,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:13,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:13,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:13,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:13,904 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:13,905 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-05-20 05:42:14,073 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 2 more)] === [2023-05-20 05:42:14,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:14,073 INFO L85 PathProgramCache]: Analyzing trace with hash 396511790, now seen corresponding path program 1 times [2023-05-20 05:42:14,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:14,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350739246] [2023-05-20 05:42:14,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:14,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-05-20 05:42:14,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350739246] [2023-05-20 05:42:14,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350739246] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:14,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:14,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-05-20 05:42:14,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129110632] [2023-05-20 05:42:14,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:14,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-05-20 05:42:14,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:14,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-05-20 05:42:14,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-05-20 05:42:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,238 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:14,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-05-20 05:42:14,337 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 2 more)] === [2023-05-20 05:42:14,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:14,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1169278845, now seen corresponding path program 1 times [2023-05-20 05:42:14,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:14,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474713943] [2023-05-20 05:42:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:14,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-05-20 05:42:14,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:14,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474713943] [2023-05-20 05:42:14,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474713943] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 05:42:14,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 05:42:14,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-05-20 05:42:14,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396924277] [2023-05-20 05:42:14,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 05:42:14,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-05-20 05:42:14,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:14,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-05-20 05:42:14,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-05-20 05:42:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,620 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:14,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:14,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 05:42:14,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-05-20 05:42:14,717 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 2 more)] === [2023-05-20 05:42:14,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:14,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1067560720, now seen corresponding path program 1 times [2023-05-20 05:42:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:14,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121332943] [2023-05-20 05:42:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-20 05:42:14,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121332943] [2023-05-20 05:42:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121332943] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 05:42:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845485666] [2023-05-20 05:42:14,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:14,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:42:14,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:42:14,988 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 05:42:15,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-05-20 05:42:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:15,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 9 conjunts are in the unsatisfiable core [2023-05-20 05:42:15,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 05:42:15,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-20 05:42:15,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 05:42:15,656 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-20 05:42:15,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845485666] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 05:42:15,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 05:42:15,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 7] total 11 [2023-05-20 05:42:15,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567374113] [2023-05-20 05:42:15,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 05:42:15,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-05-20 05:42:15,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 05:42:15,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-05-20 05:42:15,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-05-20 05:42:15,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:15,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 05:42:15,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 24.545454545454547) internal successors, (270), 11 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-05-20 05:42:15,658 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-05-20 05:42:15,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-05-20 05:42:15,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-20 05:42:15,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:42:15,970 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 2 more)] === [2023-05-20 05:42:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 05:42:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 842217791, now seen corresponding path program 1 times [2023-05-20 05:42:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 05:42:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669286568] [2023-05-20 05:42:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 05:42:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:26,026 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:42:26,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 05:42:26,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669286568] [2023-05-20 05:42:26,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669286568] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 05:42:26,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160825227] [2023-05-20 05:42:26,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 05:42:26,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:42:26,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 05:42:26,029 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 05:42:26,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-05-20 05:42:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 05:42:26,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 124 conjunts are in the unsatisfiable core [2023-05-20 05:42:26,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 05:42:26,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 05:42:26,410 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-05-20 05:42:26,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-05-20 05:42:27,561 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-05-20 05:42:27,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2023-05-20 05:42:29,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 05:42:30,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-05-20 05:42:31,481 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 05:42:31,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 05:42:31,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 05:42:32,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 05:42:33,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 05:42:33,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 05:42:33,769 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2023-05-20 05:42:33,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 49 [2023-05-20 05:42:33,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2023-05-20 05:42:34,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 05:42:34,091 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-05-20 05:42:34,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 28 treesize of output 33 [2023-05-20 05:42:34,653 INFO L356 Elim1Store]: treesize reduction 29, result has 45.3 percent of original size [2023-05-20 05:42:34,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 34 [2023-05-20 05:42:34,722 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 05:42:34,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 05:42:35,420 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 0 (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ (select (select .cse0 c_~q2~0.base) .cse1) (select (select .cse0 c_~q1~0.base) .cse2) c_~total~0 1)))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (<= (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ (select (select .cse3 c_~q2~0.base) .cse1) (select (select .cse3 c_~q1~0.base) .cse2) c_~total~0)) 0)))) (not (< c_~q2_front~0 c_~n2~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0))) is different from false [2023-05-20 05:42:35,984 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ c_~f~0.offset (* c_~i~0 4))) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse8 (+ c_~f~0.offset (* c_~j~0 4))) (.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse4 (select .cse3 ~f~0.base))) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 0 (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ (select (select .cse0 c_~q2~0.base) .cse1) (select (select .cse0 c_~q1~0.base) .cse2) c_~total~0 1)))) (not (= (select .cse4 .cse5) (select (select .cse3 c_~q1~0.base) .cse6))) (not (= (+ (select (select .cse3 c_~q2~0.base) .cse7) (select .cse4 .cse8)) 0)))))) (forall ((v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse9 (select .cse10 ~f~0.base))) (or (not (= (select .cse9 .cse5) (select (select .cse10 c_~q1~0.base) .cse6))) (not (= (+ (select (select .cse10 c_~q2~0.base) .cse7) (select .cse9 .cse8)) 0)) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (<= (let ((.cse11 (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ (select (select .cse11 c_~q2~0.base) .cse1) (select (select .cse11 c_~q1~0.base) .cse2) c_~total~0)) 0)))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_front~0 c_~n2~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2023-05-20 05:42:37,334 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_front~0 c_~n2~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (not (<= 0 c_~q2_back~0)) (let ((.cse1 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse5 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse6 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse8 (+ (* c_~j~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse4 (select .cse3 ~f~0.base))) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (<= (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ c_~total~0 (select (select .cse0 c_~q2~0.base) .cse1) (select (select .cse0 c_~q1~0.base) .cse2))) 0)) (not (= (select .cse4 .cse5) (select (select .cse3 c_~q1~0.base) .cse6))) (not (= (+ (select (select .cse3 c_~q2~0.base) .cse7) (select .cse4 .cse8)) 0)))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse11 (select .cse10 ~f~0.base))) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 0 (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ c_~total~0 (select (select .cse9 c_~q2~0.base) .cse1) (select (select .cse9 c_~q1~0.base) .cse2) 1)))) (not (= (select .cse11 .cse5) (select (select .cse10 c_~q1~0.base) .cse6))) (not (= (+ (select (select .cse10 c_~q2~0.base) .cse7) (select .cse11 .cse8)) 0))))))))) is different from false [2023-05-20 05:42:37,382 WARN L833 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~i~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse8 (+ (* c_~j~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse0 (select .cse2 ~f~0.base))) (or (not (= (select .cse0 .cse1) (select (select .cse2 c_~q1~0.base) .cse3))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (<= (let ((.cse4 (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ c_~total~0 (select (select .cse4 c_~q2~0.base) .cse5) (select (select .cse4 c_~q1~0.base) .cse6))) 0)) (not (= (+ (select (select .cse2 c_~q2~0.base) .cse7) (select .cse0 .cse8)) 0)))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse11 (select .cse10 ~f~0.base))) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 0 (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ c_~total~0 (select (select .cse9 c_~q2~0.base) .cse5) (select (select .cse9 c_~q1~0.base) .cse6) 1)))) (not (= (select .cse11 .cse1) (select (select .cse10 c_~q1~0.base) .cse3))) (not (= (+ (select (select .cse10 c_~q2~0.base) .cse7) (select .cse11 .cse8)) 0)))))))) (not (<= 0 c_~q1_back~0)) (not (< c_~q2_front~0 c_~n2~0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2023-05-20 05:42:38,184 WARN L833 $PredicateComparison]: unable to prove that (or (not (<= 0 c_~q1_back~0)) (not (< c_~q2_front~0 c_~n2~0)) (let ((.cse4 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset| (* c_~i~0 4))) (.cse1 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse2 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse7 (+ (* c_~q2_back~0 4) c_~q2~0.offset)) (.cse8 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.offset| (* c_~j~0 4)))) (and (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse3 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse5 (select .cse3 ~f~0.base))) (or (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (<= (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ (select (select .cse0 c_~q1~0.base) .cse1) c_~total~0 (select (select .cse0 c_~q2~0.base) .cse2))) 0)) (not (= (select (select .cse3 c_~q1~0.base) .cse4) (select .cse5 .cse6))) (not (= (+ (select (select .cse3 c_~q2~0.base) .cse7) (select .cse5 .cse8)) 0)))))) (forall ((v_ArrVal_353 (Array Int Int)) (v_ArrVal_352 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (~f~0.base Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc36#1.base| v_ArrVal_352) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_353) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_354))) (let ((.cse10 (select .cse9 ~f~0.base))) (or (not (= (select (select .cse9 c_~q1~0.base) .cse4) (select .cse10 .cse6))) (forall ((v_ArrVal_355 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (< 0 (let ((.cse11 (store (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_355) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_356))) (+ (select (select .cse11 c_~q1~0.base) .cse1) c_~total~0 (select (select .cse11 c_~q2~0.base) .cse2) 1)))) (not (= (+ (select (select .cse9 c_~q2~0.base) .cse7) (select .cse10 .cse8)) 0)))))))) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_front~0)) (not (<= 0 c_~q1_front~0)) (not (< c_~q1_front~0 c_~n1~0)) (not (<= 0 c_~q2_back~0))) is different from false [2023-05-20 05:42:41,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:42:41,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 139 [2023-05-20 05:42:42,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:42:42,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7401250 treesize of output 7268410 [2023-05-20 05:42:55,287 WARN L233 SmtUtils]: Spent 13.07s on a formula simplification that was a NOOP. DAG size: 1601 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 05:42:55,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:42:55,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 7241718 treesize of output 6455302 [2023-05-20 05:43:08,395 WARN L233 SmtUtils]: Spent 13.00s on a formula simplification that was a NOOP. DAG size: 1603 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 05:43:08,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:43:08,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 6455286 treesize of output 4882438 [2023-05-20 05:43:21,489 WARN L233 SmtUtils]: Spent 12.99s on a formula simplification that was a NOOP. DAG size: 1605 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 05:43:21,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:43:21,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4908866 treesize of output 4809334 [2023-05-20 05:43:34,806 WARN L233 SmtUtils]: Spent 13.10s on a formula simplification that was a NOOP. DAG size: 1647 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 05:43:35,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:43:35,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4809122 treesize of output 4609846 [2023-05-20 05:43:48,178 WARN L233 SmtUtils]: Spent 13.14s on a formula simplification that was a NOOP. DAG size: 1689 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 05:43:48,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 05:43:48,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4609634 treesize of output 4210870 [2023-05-20 05:44:01,602 WARN L233 SmtUtils]: Spent 13.20s on a formula simplification that was a NOOP. DAG size: 1731 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-05-20 05:56:22,263 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 05:56:22,271 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 05:56:22,278 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 [2023-05-20 05:56:22,304 WARN L249 SmtUtils]: Removed 2 from assertion stack [2023-05-20 05:56:22,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-05-20 05:56:22,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-05-20 05:56:22,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 05:56:22,525 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 233 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 51ms.. [2023-05-20 05:56:22,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-05-20 05:56:22,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-05-20 05:56:22,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-05-20 05:56:22,526 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-05-20 05:56:22,537 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-05-20 05:56:22,540 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 05:56:22,540 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 05:56:22,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 05:56:22 BasicIcfg [2023-05-20 05:56:22,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 05:56:22,552 INFO L158 Benchmark]: Toolchain (without parser) took 853601.84ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 148.4MB in the beginning and 543.6MB in the end (delta: -395.2MB). Peak memory consumption was 797.9MB. Max. memory is 8.0GB. [2023-05-20 05:56:22,552 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 91.4MB in the beginning and 91.3MB in the end (delta: 89.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 05:56:22,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.78ms. Allocated memory is still 167.8MB. Free memory was 148.1MB in the beginning and 142.7MB in the end (delta: 5.4MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. [2023-05-20 05:56:22,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.47ms. Allocated memory is still 167.8MB. Free memory was 142.7MB in the beginning and 139.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 05:56:22,554 INFO L158 Benchmark]: Boogie Preprocessor took 53.12ms. Allocated memory is still 167.8MB. Free memory was 139.9MB in the beginning and 137.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-05-20 05:56:22,554 INFO L158 Benchmark]: RCFGBuilder took 739.52ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 133.4MB in the end (delta: 4.1MB). Peak memory consumption was 46.9MB. Max. memory is 8.0GB. [2023-05-20 05:56:22,556 INFO L158 Benchmark]: TraceAbstraction took 852475.05ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 132.3MB in the beginning and 543.6MB in the end (delta: -411.2MB). Peak memory consumption was 782.0MB. Max. memory is 8.0GB. [2023-05-20 05:56:22,558 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 127.9MB. Free memory was 91.4MB in the beginning and 91.3MB in the end (delta: 89.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.78ms. Allocated memory is still 167.8MB. Free memory was 148.1MB in the beginning and 142.7MB in the end (delta: 5.4MB). Peak memory consumption was 9.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.47ms. Allocated memory is still 167.8MB. Free memory was 142.7MB in the beginning and 139.9MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 53.12ms. Allocated memory is still 167.8MB. Free memory was 139.9MB in the beginning and 137.5MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 739.52ms. Allocated memory is still 167.8MB. Free memory was 137.5MB in the beginning and 133.4MB in the end (delta: 4.1MB). Peak memory consumption was 46.9MB. Max. memory is 8.0GB. * TraceAbstraction took 852475.05ms. Allocated memory was 167.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 132.3MB in the beginning and 543.6MB in the end (delta: -411.2MB). Peak memory consumption was 782.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4928, independent: 4454, independent conditional: 1864, independent unconditional: 2590, dependent: 474, dependent conditional: 440, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 1864, independent unconditional: 2590, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 1864, independent unconditional: 2590, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 0, independent unconditional: 4454, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 0, independent unconditional: 4454, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 0, independent unconditional: 4454, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2447, independent: 2413, independent conditional: 0, independent unconditional: 2413, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2447, independent: 2410, independent conditional: 0, independent unconditional: 2410, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4488, independent: 2041, independent conditional: 0, independent unconditional: 2041, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2447, unknown conditional: 0, unknown unconditional: 2447] , Statistics on independence cache: Total cache size (in pairs): 2447, Positive cache size: 2413, Positive conditional cache size: 0, Positive unconditional cache size: 2413, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 440 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 276, Number of trivial persistent sets: 246, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2624, independent: 2590, independent conditional: 0, independent unconditional: 2590, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4928, independent: 4454, independent conditional: 1864, independent unconditional: 2590, dependent: 474, dependent conditional: 440, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 1864, independent unconditional: 2590, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 1864, independent unconditional: 2590, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 0, independent unconditional: 4454, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 0, independent unconditional: 4454, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4488, independent: 4454, independent conditional: 0, independent unconditional: 4454, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2447, independent: 2413, independent conditional: 0, independent unconditional: 2413, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2447, independent: 2410, independent conditional: 0, independent unconditional: 2410, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 37, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 37, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 127, independent: 37, independent conditional: 0, independent unconditional: 37, dependent: 90, dependent conditional: 0, dependent unconditional: 90, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 4488, independent: 2041, independent conditional: 0, independent unconditional: 2041, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2447, unknown conditional: 0, unknown unconditional: 2447] , Statistics on independence cache: Total cache size (in pairs): 2447, Positive cache size: 2413, Positive conditional cache size: 0, Positive unconditional cache size: 2413, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 440 - TimeoutResultAtElement [Line: 151]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 233 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 51ms.. - TimeoutResultAtElement [Line: 142]: 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 233 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 51ms.. - TimeoutResultAtElement [Line: 144]: 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 233 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 51ms.. - TimeoutResultAtElement [Line: 141]: 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 233 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 51ms.. - TimeoutResultAtElement [Line: 143]: 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 233 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 6 for 51ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 276 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 852.3s, OverallIterations: 10, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 1.2s, 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: 66, 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.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2357 NumberOfCodeBlocks, 2357 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2778 ConstructedInterpolants, 0 QuantifiedInterpolants, 7725 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1082 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 129/141 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