/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 X --traceabstraction.defines.what.statements.are.considered.a.step.in.por ALL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 11:10:21,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 11:10:21,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 11:10:21,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 11:10:21,538 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 11:10:21,538 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 11:10:21,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 11:10:21,540 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 11:10:21,541 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 11:10:21,541 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 11:10:21,542 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 11:10:21,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 11:10:21,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 11:10:21,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 11:10:21,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 11:10:21,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 11:10:21,545 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 11:10:21,546 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 11:10:21,547 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 11:10:21,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 11:10:21,548 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 11:10:21,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 11:10:21,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 11:10:21,558 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 11:10:21,564 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 11:10:21,564 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 11:10:21,564 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 11:10:21,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 11:10:21,565 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 11:10:21,566 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 11:10:21,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 11:10:21,566 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 11:10:21,567 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 11:10:21,567 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 11:10:21,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 11:10:21,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 11:10:21,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 11:10:21,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 11:10:21,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 11:10:21,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 11:10:21,569 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 11:10:21,575 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 11:10:21,594 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 11:10:21,595 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 11:10:21,595 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 11:10:21,595 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 11:10:21,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 11:10:21,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 11:10:21,596 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 11:10:21,596 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 11:10:21,596 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 11:10:21,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 11:10:21,596 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 11:10:21,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 11:10:21,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 11:10:21,599 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 11:10:21,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 11:10:21,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 11:10:21,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 11:10:21,599 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 11:10:21,599 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 11:10:21,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 11:10:21,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 11:10:21,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 11:10:21,601 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 11:10:21,602 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 -> X Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> ALL_READ_WRITE [2023-05-20 11:10:21,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 11:10:21,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 11:10:21,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 11:10:21,787 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 11:10:21,787 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 11:10:21,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-05-20 11:10:21,841 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1395a845/631a7de3bf87494384b44b50db748ae3/FLAG3d30b2495 [2023-05-20 11:10:22,184 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 11:10:22,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-05-20 11:10:22,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1395a845/631a7de3bf87494384b44b50db748ae3/FLAG3d30b2495 [2023-05-20 11:10:22,205 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1395a845/631a7de3bf87494384b44b50db748ae3 [2023-05-20 11:10:22,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 11:10:22,209 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 11:10:22,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 11:10:22,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 11:10:22,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 11:10:22,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5954a9cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22, skipping insertion in model container [2023-05-20 11:10:22,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,220 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 11:10:22,231 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 11:10:22,394 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/mult-comm.wvr.c[1910,1923] [2023-05-20 11:10:22,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 11:10:22,402 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 11:10:22,423 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/mult-comm.wvr.c[1910,1923] [2023-05-20 11:10:22,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 11:10:22,436 INFO L208 MainTranslator]: Completed translation [2023-05-20 11:10:22,436 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22 WrapperNode [2023-05-20 11:10:22,436 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 11:10:22,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 11:10:22,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 11:10:22,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 11:10:22,443 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,449 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,465 INFO L138 Inliner]: procedures = 21, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 52 [2023-05-20 11:10:22,465 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 11:10:22,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 11:10:22,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 11:10:22,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 11:10:22,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,480 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,485 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,487 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 11:10:22,488 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 11:10:22,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 11:10:22,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 11:10:22,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (1/1) ... [2023-05-20 11:10:22,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 11:10:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:10:22,526 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 11:10:22,541 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 11:10:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 11:10:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 11:10:22,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 11:10:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 11:10:22,559 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 11:10:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 11:10:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 11:10:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 11:10:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 11:10:22,560 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 11:10:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 11:10:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 11:10:22,561 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 11:10:22,636 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 11:10:22,638 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 11:10:22,752 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 11:10:22,757 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 11:10:22,757 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-05-20 11:10:22,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 11:10:22 BoogieIcfgContainer [2023-05-20 11:10:22,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 11:10:22,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 11:10:22,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 11:10:22,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 11:10:22,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 11:10:22" (1/3) ... [2023-05-20 11:10:22,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce21922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 11:10:22, skipping insertion in model container [2023-05-20 11:10:22,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 11:10:22" (2/3) ... [2023-05-20 11:10:22,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce21922 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 11:10:22, skipping insertion in model container [2023-05-20 11:10:22,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 11:10:22" (3/3) ... [2023-05-20 11:10:22,765 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2023-05-20 11:10:22,770 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 11:10:22,775 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 11:10:22,775 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 11:10:22,776 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 11:10:22,816 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-05-20 11:10:22,866 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 11:10:22,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 11:10:22,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:10:22,877 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 11:10:22,880 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 11:10:22,902 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 11:10:22,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 11:10:22,918 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;@6ea1dfb5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 11:10:22,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-05-20 11:10:23,045 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:10:23,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:10:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash -573152869, now seen corresponding path program 1 times [2023-05-20 11:10:23,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:10:23,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075858768] [2023-05-20 11:10:23,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:10:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:23,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:23,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:10:23,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075858768] [2023-05-20 11:10:23,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075858768] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 11:10:23,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 11:10:23,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 11:10:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487284713] [2023-05-20 11:10:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 11:10:23,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 11:10:23,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:10:23,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 11:10:23,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 11:10:23,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:23,257 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:10:23,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 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 11:10:23,258 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:23,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 11:10:23,332 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:10:23,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:10:23,333 INFO L85 PathProgramCache]: Analyzing trace with hash -356656277, now seen corresponding path program 1 times [2023-05-20 11:10:23,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:10:23,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480043343] [2023-05-20 11:10:23,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:23,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:10:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:23,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:10:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480043343] [2023-05-20 11:10:23,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480043343] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:10:23,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546583220] [2023-05-20 11:10:23,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:23,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:10:23,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:10:23,954 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 11:10:24,016 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 11:10:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:24,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 16 conjunts are in the unsatisfiable core [2023-05-20 11:10:24,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:10:24,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:24,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:10:24,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:24,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546583220] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:10:24,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:10:24,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 13 [2023-05-20 11:10:24,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587950780] [2023-05-20 11:10:24,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:10:24,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-05-20 11:10:24,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:10:24,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-05-20 11:10:24,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-05-20 11:10:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:24,631 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:10:24,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 8.076923076923077) internal successors, (105), 13 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-05-20 11:10:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:24,632 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-05-20 11:10:24,950 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 11:10:25,133 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,SelfDestructingSolverStorable1 [2023-05-20 11:10:25,133 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:10:25,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:10:25,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1277853625, now seen corresponding path program 1 times [2023-05-20 11:10:25,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:10:25,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214753272] [2023-05-20 11:10:25,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:25,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:10:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:25,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:25,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:10:25,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214753272] [2023-05-20 11:10:25,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214753272] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:10:25,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474148403] [2023-05-20 11:10:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:25,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:10:25,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:10:25,411 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 11:10:25,428 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 11:10:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:25,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 17 conjunts are in the unsatisfiable core [2023-05-20 11:10:25,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:10:25,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:25,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:10:25,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:25,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474148403] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:10:25,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:10:25,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 17 [2023-05-20 11:10:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797238423] [2023-05-20 11:10:25,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:10:25,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-05-20 11:10:25,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:10:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-05-20 11:10:25,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-05-20 11:10:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:25,869 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:10:25,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 7.117647058823529) internal successors, (121), 17 states have internal predecessors, (121), 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 11:10:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-05-20 11:10:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:26,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 11:10:26,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 11:10:26,045 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 11:10:26,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:10:26,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:10:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:10:26,244 INFO L85 PathProgramCache]: Analyzing trace with hash 593834245, now seen corresponding path program 1 times [2023-05-20 11:10:26,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:10:26,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789369730] [2023-05-20 11:10:26,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:26,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:10:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:26,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:10:26,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789369730] [2023-05-20 11:10:26,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789369730] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:10:26,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717473] [2023-05-20 11:10:26,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:26,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:10:26,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:10:26,955 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 11:10:26,978 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 11:10:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:27,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 29 conjunts are in the unsatisfiable core [2023-05-20 11:10:27,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:10:28,488 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:28,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:10:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:30,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717473] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:10:30,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:10:30,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 17] total 37 [2023-05-20 11:10:30,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931886100] [2023-05-20 11:10:30,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:10:30,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-05-20 11:10:30,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:10:30,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-05-20 11:10:30,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1143, Unknown=0, NotChecked=0, Total=1332 [2023-05-20 11:10:30,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:30,767 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:10:30,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.6486486486486487) internal successors, (135), 37 states have internal predecessors, (135), 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 11:10:30,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:30,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 11:10:30,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 11:10:30,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:10:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 11:10:34,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-05-20 11:10:34,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-05-20 11:10:34,407 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 11:10:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:10:34,595 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-05-20 11:10:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 11:10:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1463051643, now seen corresponding path program 2 times [2023-05-20 11:10:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 11:10:34,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831315580] [2023-05-20 11:10:34,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 11:10:34,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 11:10:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 11:10:40,702 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:10:40,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 11:10:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831315580] [2023-05-20 11:10:40,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831315580] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 11:10:40,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606734150] [2023-05-20 11:10:40,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 11:10:40,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 11:10:40,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 11:10:40,705 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 11:10:40,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-05-20 11:10:40,948 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 11:10:40,949 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 11:10:40,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 42 conjunts are in the unsatisfiable core [2023-05-20 11:10:40,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 11:11:09,036 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:11:09,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 11:13:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 11:13:50,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606734150] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 11:13:50,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 11:13:50,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 24] total 58 [2023-05-20 11:13:50,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908643799] [2023-05-20 11:13:50,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 11:13:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-05-20 11:13:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 11:13:50,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-05-20 11:13:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=2976, Unknown=68, NotChecked=0, Total=3306 [2023-05-20 11:13:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:13:50,149 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 11:13:50,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.793103448275862) internal successors, (162), 58 states have internal predecessors, (162), 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 11:13:50,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:13:50,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 11:13:50,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-05-20 11:13:50,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2023-05-20 11:13:50,150 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 11:14:23,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:14:55,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:14:57,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:15:25,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:15:40,614 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:15:53,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:16:25,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:16:41,543 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 48 DAG size of output: 25 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:17:03,366 WARN L233 SmtUtils]: Spent 17.89s on a formula simplification. DAG size of input: 72 DAG size of output: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:17:05,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:17:07,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:17:09,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:17:12,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:17:26,563 WARN L233 SmtUtils]: Spent 7.34s on a formula simplification. DAG size of input: 69 DAG size of output: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:17:43,266 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (* 3 c_~b~0))) (let ((.cse1 (mod c_~a~0 4294967296)) (.cse4 (* 2 c_~b~0)) (.cse7 (* 4294967296 (div (+ c_~x_2~0 .cse9) 4294967296))) (.cse8 (* 4294967296 (div c_~x_1~0 4294967296)))) (let ((.cse11 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse10 (+ c_~x_2~0 .cse8)) (.cse5 (+ c_~x_1~0 .cse7)) (.cse2 (let ((.cse16 (+ c_~x_2~0 .cse4 .cse8)) (.cse15 (* (div (+ c_~x_2~0 .cse4) 4294967296) 4294967296))) (and (<= (+ .cse15 c_~x_1~0) .cse16) (< .cse16 (+ .cse15 c_~x_1~0 1))))) (.cse0 (not (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse1))) (.cse3 (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse1)) (.cse14 (div c_thread2Thread1of1ForFork1_~i~1 4294967296))) (and (or .cse0 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse1) .cse2 (not .cse3)) (<= (div (+ c_~b~0 (div (+ (* c_~b~0 (- 715827882)) (* c_~x_2~0 715827883) 2147483646) 2147483648)) 1431655766) (+ (div (+ (- c_~x_1~0) c_~x_2~0 (- 2) .cse4 c_~a~0 (- c_thread2Thread1of1ForFork1_~i~1)) 4294967296) (div (+ (- 1) c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (= c_~x_2~0 .cse4) (<= c_~x_1~0 c_~a~0) (or (< 3 .cse1) (let ((.cse6 (+ c_~x_2~0 .cse8 .cse9))) (and (<= .cse5 .cse6) (< .cse6 (+ c_~x_1~0 .cse7 1)))) (<= .cse1 2)) (<= (+ c_~x_2~0 .cse4 c_~a~0) (+ (* (div (+ c_~x_2~0 (- 3) .cse4) 4294967296) 4294967296) c_~x_1~0 2 c_thread2Thread1of1ForFork1_~i~1)) (< .cse10 (+ c_~x_1~0 .cse11 1)) (<= c_~x_1~0 (+ (* (div c_~a~0 4294967296) 4294967296) 4294967295)) (<= (+ c_~x_1~0 .cse11) .cse10) (or (and (< (+ c_~x_2~0 (* 4294967296 (div (+ c_~x_1~0 3) 4294967296)) .cse9) (+ c_~x_1~0 4 .cse7)) (< .cse5 (+ c_~x_2~0 4294967294 (* (div (+ c_~x_1~0 (- 4294967293)) 4294967296) 4294967296) .cse9))) (< (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296) (mod c_~b~0 4294967296))) (<= (+ .cse9 c_~a~0) (+ c_~x_1~0 3 (* (div (+ (- 3) .cse9) 4294967296) 4294967296))) (or .cse0 .cse3 .cse2) (< 1 .cse1) (or .cse0 (let ((.cse13 (+ c_~x_2~0 c_~b~0 .cse8)) (.cse12 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse12 c_~x_1~0) .cse13) (< .cse13 (+ .cse12 c_~x_1~0 1)))) .cse3) (= 2 c_thread2Thread1of1ForFork1_~i~1) (<= c_thread2Thread1of1ForFork1_~i~1 (+ 4294967294 (* .cse14 4294967296))) (<= .cse14 0))))) is different from false [2023-05-20 11:18:12,575 WARN L233 SmtUtils]: Spent 19.17s on a formula simplification. DAG size of input: 83 DAG size of output: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:18:14,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:31,337 WARN L233 SmtUtils]: Spent 44.61s on a formula simplification. DAG size of input: 101 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:19:33,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:35,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:37,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:39,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:41,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:43,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:45,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:47,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:19:49,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:20:44,320 WARN L233 SmtUtils]: Spent 37.81s on a formula simplification. DAG size of input: 133 DAG size of output: 80 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:20:46,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:20:48,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:20:51,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:20:53,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:20:55,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:20:58,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:21:01,092 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (div c_~x_1~0 4294967296))) (let ((.cse17 (+ |c_thread2Thread1of1ForFork1_#t~post2| 1)) (.cse0 (* c_~x_2~0 715827883)) (.cse2 (* 2 c_~b~0)) (.cse21 (* 4294967296 .cse24)) (.cse6 (mod c_~a~0 4294967296)) (.cse8 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse9 (div c_~a~0 4294967296))) (let ((.cse3 (- c_thread2Thread1of1ForFork1_~i~1)) (.cse11 (* .cse9 4294967296)) (.cse10 (+ .cse8 .cse24)) (.cse4 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse6)) (.cse14 (let ((.cse23 (+ c_~x_2~0 .cse2 .cse21)) (.cse22 (* (div (+ c_~x_2~0 .cse2) 4294967296) 4294967296))) (and (<= (+ .cse22 c_~x_1~0) .cse23) (< .cse23 (+ .cse22 c_~x_1~0 1))))) (.cse7 (div (+ c_~b~0 (div (+ (* (- 1431655765) c_~b~0) .cse0 2147483646) 2147483648)) 1431655766)) (.cse1 (- c_~x_1~0)) (.cse12 (+ c_~x_2~0 c_~b~0 c_~a~0)) (.cse13 (* (div (+ c_~x_2~0 c_~b~0 (- 3)) 4294967296) 4294967296)) (.cse5 (let ((.cse20 (+ c_~x_2~0 c_~b~0 .cse21)) (.cse19 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse19 c_~x_1~0) .cse20) (< .cse20 (+ .cse19 c_~x_1~0 1))))) (.cse16 (not (< (mod .cse17 4294967296) .cse6))) (.cse15 (< (mod (+ 2 |c_thread2Thread1of1ForFork1_#t~post2|) 4294967296) .cse6))) (and (<= (div (+ c_~b~0 (div (+ (* c_~b~0 (- 715827882)) .cse0 2147483646) 2147483648)) 1431655766) (+ (div (+ .cse1 c_~x_2~0 (- 2) .cse2 c_~a~0 .cse3) 4294967296) (div (+ (- 1) c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (= (mod (* c_~x_2~0 2) 3) 0) (<= c_~x_1~0 c_~a~0) (= c_thread2Thread1of1ForFork1_~i~1 3) (or .cse4 .cse5 (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse6))) (<= (+ c_~x_2~0 .cse2 c_~a~0) (+ (* (div (+ c_~x_2~0 (- 3) .cse2) 4294967296) 4294967296) c_~x_1~0 2 c_thread2Thread1of1ForFork1_~i~1)) (or (<= (+ .cse7 .cse8) (+ (div (+ .cse1 (- 1) c_~x_2~0 c_~b~0 c_~a~0 .cse3) 4294967296) (div (+ (- 2) c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (not (<= .cse9 .cse10))) (<= |c_thread2Thread1of1ForFork1_#t~post2| (+ .cse11 (* (div (+ .cse1 4294967295) 4294967296) 4294967296) 4294967294)) (= 2 |c_thread2Thread1of1ForFork1_#t~post2|) (<= c_~x_1~0 (+ .cse11 4294967295)) (<= .cse12 (+ c_~x_1~0 2 .cse13 |c_thread2Thread1of1ForFork1_#t~post2|)) (not (<= (+ .cse9 1) .cse10)) (or (not .cse4) (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse6) .cse14) (or (not .cse15) (< (mod (+ 3 |c_thread2Thread1of1ForFork1_#t~post2|) 4294967296) .cse6) .cse16 .cse14) (<= (+ .cse7 (div .cse17 4294967296)) (+ (div (+ .cse1 c_~x_2~0 (- 2) (- |c_thread2Thread1of1ForFork1_#t~post2|) c_~b~0 c_~a~0) 4294967296) (div (+ (- 1) |c_thread2Thread1of1ForFork1_#t~post2|) 4294967296))) (<= .cse12 (+ c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 .cse13 1)) (< 2 .cse6) (or .cse5 .cse16 .cse15) (let ((.cse18 (* (div (- c_~x_2~0) (- 3)) 3))) (<= (+ .cse18 c_~a~0) (+ c_~x_1~0 3 (* (div (+ (- 3) .cse18) 4294967296) 4294967296)))) (<= .cse8 0))))) is different from false [2023-05-20 11:23:29,866 WARN L233 SmtUtils]: Spent 1.79m on a formula simplification. DAG size of input: 121 DAG size of output: 95 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:23:31,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:33,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:36,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:38,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:40,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:43,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:45,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:47,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:49,524 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse27 (div c_~x_1~0 4294967296)) (.cse10 (mod c_~a~0 4294967296))) (let ((.cse20 (* (div (- c_~x_2~0) (- 3)) 3)) (.cse8 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse10)) (.cse6 (* 2 c_~b~0)) (.cse11 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse19 (* 4294967296 .cse27)) (.cse22 (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse10))) (let ((.cse4 (* c_~x_2~0 715827883)) (.cse7 (- c_thread2Thread1of1ForFork1_~i~1)) (.cse1 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) .cse10)) (.cse3 (not .cse22)) (.cse5 (- c_~x_1~0)) (.cse15 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse14 (+ c_~x_2~0 .cse19)) (.cse12 (div c_~a~0 4294967296)) (.cse13 (+ .cse11 .cse27)) (.cse2 (let ((.cse26 (+ c_~x_2~0 .cse6 .cse19)) (.cse25 (* (div (+ c_~x_2~0 .cse6) 4294967296) 4294967296))) (and (<= (+ .cse25 c_~x_1~0) .cse26) (< .cse26 (+ .cse25 c_~x_1~0 1))))) (.cse0 (not .cse8)) (.cse9 (let ((.cse24 (+ c_~x_2~0 c_~b~0 .cse19)) (.cse23 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse23 c_~x_1~0) .cse24) (< .cse24 (+ .cse23 c_~x_1~0 1))))) (.cse21 (div (+ (- 3) .cse20) 4294967296))) (and (or .cse0 .cse1 .cse2 .cse3) (<= (div (+ c_~b~0 (div (+ (* c_~b~0 (- 715827882)) .cse4 2147483646) 2147483648)) 1431655766) (+ (div (+ .cse5 c_~x_2~0 (- 2) .cse6 c_~a~0 .cse7) 4294967296) (div (+ (- 1) c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (= (mod (* c_~x_2~0 2) 3) 0) (<= c_~x_1~0 c_~a~0) (= c_thread2Thread1of1ForFork1_~i~1 3) (or .cse8 .cse9 (not (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse10))) (<= (+ c_~x_2~0 .cse6 c_~a~0) (+ (* (div (+ c_~x_2~0 (- 3) .cse6) 4294967296) 4294967296) c_~x_1~0 2 c_thread2Thread1of1ForFork1_~i~1)) (or (<= (+ (div (+ c_~b~0 (div (+ (* (- 1431655765) c_~b~0) .cse4 2147483646) 2147483648)) 1431655766) .cse11) (+ (div (+ .cse5 (- 1) c_~x_2~0 c_~b~0 c_~a~0 .cse7) 4294967296) (div (+ (- 2) c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (not (<= .cse12 .cse13))) (< .cse14 (+ c_~x_1~0 .cse15 1)) (<= c_~x_1~0 (+ (* .cse12 4294967296) 4294967295)) (or .cse0 (let ((.cse18 (* 3 c_~b~0))) (let ((.cse17 (+ c_~x_2~0 .cse19 .cse18)) (.cse16 (* 4294967296 (div (+ c_~x_2~0 .cse18) 4294967296)))) (and (<= (+ c_~x_1~0 .cse16) .cse17) (< .cse17 (+ c_~x_1~0 .cse16 1))))) .cse1 .cse3) (<= (+ 8589934592 (* 4294967296 (div (+ .cse5 (- 4) .cse20) 4294967296)) .cse19 (* (div (+ c_~x_1~0 (- 4)) 4294967296) 4294967296) .cse20) (+ c_~x_1~0 (* 8589934592 .cse21))) (<= (+ c_~x_1~0 .cse15) .cse14) (not (<= (+ .cse12 1) .cse13)) (or .cse0 .cse22 .cse2) (<= (+ c_~x_2~0 c_~b~0 c_~a~0) (+ c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 (* (div (+ c_~x_2~0 c_~b~0 (- 3)) 4294967296) 4294967296) 1)) (or .cse0 .cse9 .cse22) (< 2 .cse10) (<= c_thread2Thread1of1ForFork1_~i~1 (+ 4294967294 (* .cse11 4294967296))) (<= (+ .cse20 c_~a~0) (+ c_~x_1~0 3 (* .cse21 4294967296))) (<= .cse11 0))))) is different from false [2023-05-20 11:23:51,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:53,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:55,548 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:23:57,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:00,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:01,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:04,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:05,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:07,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:09,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:11,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:13,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:15,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:17,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-05-20 11:24:19,922 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (div c_~a~0 4294967296)) (.cse4 (mod c_~a~0 4294967296)) (.cse22 (div c_~x_1~0 4294967296)) (.cse0 (* c_~x_2~0 715827883)) (.cse21 (div c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse1 (- c_~x_1~0)) (.cse3 (- c_thread2Thread1of1ForFork1_~i~1))) (let ((.cse9 (<= (+ (div (+ c_~b~0 (div (+ (* (- 1431655765) c_~b~0) .cse0 2147483646) 2147483648)) 1431655766) .cse21) (+ (div (+ .cse1 (- 1) c_~x_2~0 c_~b~0 c_~a~0 .cse3) 4294967296) (div (+ (- 2) c_thread2Thread1of1ForFork1_~i~1) 4294967296)))) (.cse11 (+ .cse21 .cse22)) (.cse13 (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296) .cse4)) (.cse2 (* 2 c_~b~0)) (.cse8 (* 4294967296 .cse22)) (.cse12 (* .cse10 4294967296)) (.cse19 (* .cse21 4294967296)) (.cse18 (* (div (+ c_~x_2~0 c_~b~0 (- 3)) 4294967296) 4294967296))) (and (<= (div (+ c_~b~0 (div (+ (* c_~b~0 (- 715827882)) .cse0 2147483646) 2147483648)) 1431655766) (+ (div (+ .cse1 c_~x_2~0 (- 2) .cse2 c_~a~0 .cse3) 4294967296) (div (+ (- 1) c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (= (mod (* c_~x_2~0 2) 3) 0) (<= c_~x_1~0 c_~a~0) (= c_thread2Thread1of1ForFork1_~i~1 3) (or (< 3 .cse4) (let ((.cse7 (* 3 c_~b~0))) (let ((.cse6 (+ c_~x_2~0 .cse8 .cse7)) (.cse5 (* 4294967296 (div (+ c_~x_2~0 .cse7) 4294967296)))) (and (<= (+ c_~x_1~0 .cse5) .cse6) (< .cse6 (+ c_~x_1~0 .cse5 1))))) (<= .cse4 2)) .cse9 (<= (+ c_~x_2~0 .cse2 c_~a~0) (+ (* (div (+ c_~x_2~0 (- 3) .cse2) 4294967296) 4294967296) c_~x_1~0 2 c_thread2Thread1of1ForFork1_~i~1)) (or .cse9 (not (<= .cse10 .cse11))) (<= c_~x_1~0 (+ .cse12 4294967295)) (or .cse13 (let ((.cse15 (+ c_~x_2~0 c_~b~0 .cse8)) (.cse14 (* (div (+ c_~x_2~0 c_~b~0) 4294967296) 4294967296))) (and (<= (+ .cse14 c_~x_1~0) .cse15) (< .cse15 (+ .cse14 c_~x_1~0 1))))) (not (<= (+ .cse10 1) .cse11)) (or (not .cse13) (< (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296) .cse4) (let ((.cse17 (+ c_~x_2~0 .cse2 .cse8)) (.cse16 (* (div (+ c_~x_2~0 .cse2) 4294967296) 4294967296))) (and (<= (+ .cse16 c_~x_1~0) .cse17) (< .cse17 (+ .cse16 c_~x_1~0 1))))) (<= (+ c_~x_2~0 c_~b~0 c_~a~0) (+ c_~x_1~0 c_thread2Thread1of1ForFork1_~i~1 .cse18 1)) (< 2 .cse4) (<= c_thread2Thread1of1ForFork1_~i~1 (+ 4294967294 .cse19)) (let ((.cse20 (* (div (- c_~x_2~0) (- 3)) 3))) (<= (+ .cse20 c_~a~0) (+ c_~x_1~0 3 (* (div (+ (- 3) .cse20) 4294967296) 4294967296)))) (<= .cse21 0) (<= (+ c_~x_2~0 .cse12 c_~b~0) (+ c_~x_1~0 .cse19 .cse18))))) is different from false [2023-05-20 11:25:00,908 WARN L233 SmtUtils]: Spent 19.23s on a formula simplification. DAG size of input: 86 DAG size of output: 68 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-05-20 11:25:04,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-05-20 11:25:04,846 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 11:25:04,846 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 11:25:04,846 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 11:25:05,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:05,895 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-05-20 11:25:06,051 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-05-20 11:25:06,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-05-20 11:25:06,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-05-20 11:25:06,067 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-05-20 11:25:06,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-05-20 11:25:06,069 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-05-20 11:25:06,070 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-05-20 11:25:06,073 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2023-05-20 11:25:06,074 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 11:25:06,074 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 11:25:06,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 11:25:06 BasicIcfg [2023-05-20 11:25:06,076 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 11:25:06,076 INFO L158 Benchmark]: Toolchain (without parser) took 883867.26ms. Allocated memory was 199.2MB in the beginning and 292.6MB in the end (delta: 93.3MB). Free memory was 145.9MB in the beginning and 164.1MB in the end (delta: -18.1MB). Peak memory consumption was 75.7MB. Max. memory is 8.0GB. [2023-05-20 11:25:06,076 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 199.2MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 11:25:06,077 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.41ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 173.3MB in the end (delta: -27.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-05-20 11:25:06,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.59ms. Allocated memory is still 199.2MB. Free memory was 172.8MB in the beginning and 171.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-05-20 11:25:06,077 INFO L158 Benchmark]: Boogie Preprocessor took 21.04ms. Allocated memory is still 199.2MB. Free memory was 171.7MB in the beginning and 170.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 11:25:06,077 INFO L158 Benchmark]: RCFGBuilder took 271.22ms. Allocated memory is still 199.2MB. Free memory was 170.1MB in the beginning and 158.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-05-20 11:25:06,077 INFO L158 Benchmark]: TraceAbstraction took 883315.39ms. Allocated memory was 199.2MB in the beginning and 292.6MB in the end (delta: 93.3MB). Free memory was 157.1MB in the beginning and 164.1MB in the end (delta: -7.0MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. [2023-05-20 11:25:06,078 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.08ms. Allocated memory is still 199.2MB. Free memory is still 162.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.41ms. Allocated memory is still 199.2MB. Free memory was 145.6MB in the beginning and 173.3MB in the end (delta: -27.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.59ms. Allocated memory is still 199.2MB. Free memory was 172.8MB in the beginning and 171.7MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.04ms. Allocated memory is still 199.2MB. Free memory was 171.7MB in the beginning and 170.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 271.22ms. Allocated memory is still 199.2MB. Free memory was 170.1MB in the beginning and 158.1MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 883315.39ms. Allocated memory was 199.2MB in the beginning and 292.6MB in the end (delta: 93.3MB). Free memory was 157.1MB in the beginning and 164.1MB in the end (delta: -7.0MB). Peak memory consumption was 87.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1890, independent: 1586, independent conditional: 826, independent unconditional: 760, dependent: 304, dependent conditional: 298, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 826, independent unconditional: 760, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 826, independent unconditional: 760, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 688, independent: 682, independent conditional: 0, independent unconditional: 682, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 688, independent: 681, independent conditional: 0, independent unconditional: 681, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1592, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 688, unknown conditional: 0, unknown unconditional: 688] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 682, Positive conditional cache size: 0, Positive unconditional cache size: 682, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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: 298 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.1s, Number of persistent set computation: 143, Number of trivial persistent sets: 124, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 766, independent: 760, independent conditional: 0, independent unconditional: 760, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1890, independent: 1586, independent conditional: 826, independent unconditional: 760, dependent: 304, dependent conditional: 298, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 826, independent unconditional: 760, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 826, independent unconditional: 760, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1592, independent: 1586, independent conditional: 0, independent unconditional: 1586, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 688, independent: 682, independent conditional: 0, independent unconditional: 682, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 688, independent: 681, independent conditional: 0, independent unconditional: 681, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 1, independent conditional: 0, independent unconditional: 1, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 87, independent: 34, independent conditional: 0, independent unconditional: 34, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1592, independent: 904, independent conditional: 0, independent unconditional: 904, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 688, unknown conditional: 0, unknown unconditional: 688] , Statistics on independence cache: Total cache size (in pairs): 688, Positive cache size: 682, Positive conditional cache size: 0, Positive unconditional cache size: 682, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, 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: 298 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 96 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 883.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 680.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: 134, 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.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 201.5s InterpolantComputationTime, 575 NumberOfCodeBlocks, 575 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 822 ConstructedInterpolants, 2 QuantifiedInterpolants, 14953 SizeOfPredicates, 46 NumberOfNonLiveVariables, 604 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 0/69 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