/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por LOOP -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-32214ab [2023-05-20 08:24:31,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-20 08:24:31,719 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-20 08:24:31,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-20 08:24:31,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-20 08:24:31,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-20 08:24:31,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-20 08:24:31,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-20 08:24:31,777 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-20 08:24:31,781 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-20 08:24:31,782 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-20 08:24:31,784 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-20 08:24:31,784 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-20 08:24:31,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-20 08:24:31,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-20 08:24:31,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-20 08:24:31,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-20 08:24:31,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-20 08:24:31,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-20 08:24:31,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-20 08:24:31,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-20 08:24:31,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-20 08:24:31,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-20 08:24:31,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-20 08:24:31,807 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-20 08:24:31,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-20 08:24:31,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-20 08:24:31,809 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-20 08:24:31,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-20 08:24:31,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-20 08:24:31,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-20 08:24:31,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-20 08:24:31,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-20 08:24:31,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-20 08:24:31,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-20 08:24:31,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-20 08:24:31,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-20 08:24:31,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-20 08:24:31,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-20 08:24:31,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-20 08:24:31,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-20 08:24:31,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-20 08:24:31,841 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-20 08:24:31,841 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-20 08:24:31,841 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-20 08:24:31,842 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-20 08:24:31,842 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-20 08:24:31,843 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-20 08:24:31,843 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-20 08:24:31,843 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-20 08:24:31,843 INFO L138 SettingsManager]: * Use SBE=true [2023-05-20 08:24:31,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-20 08:24:31,844 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-20 08:24:31,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-20 08:24:31,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-20 08:24:31,846 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-20 08:24:31,846 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-20 08:24:31,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-20 08:24:31,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-20 08:24:31,847 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-20 08:24:31,847 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-20 08:24:31,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 08:24:31,848 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-20 08:24:31,848 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-20 08:24:31,848 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-20 08:24:31,848 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-20 08:24:31,848 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-20 08:24:31,848 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-20 08:24:31,848 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-20 08:24:31,849 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-20 08:24:31,849 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-20 08:24:31,849 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-20 08:24:31,849 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> LOOP [2023-05-20 08:24:32,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-20 08:24:32,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-20 08:24:32,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-20 08:24:32,116 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-20 08:24:32,120 INFO L275 PluginConnector]: CDTParser initialized [2023-05-20 08:24:32,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-05-20 08:24:32,197 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef56c834d/b62c0f4602ed4ded8b5bfadcc031f915/FLAG5841ae971 [2023-05-20 08:24:32,581 INFO L306 CDTParser]: Found 1 translation units. [2023-05-20 08:24:32,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c [2023-05-20 08:24:32,587 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef56c834d/b62c0f4602ed4ded8b5bfadcc031f915/FLAG5841ae971 [2023-05-20 08:24:32,599 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef56c834d/b62c0f4602ed4ded8b5bfadcc031f915 [2023-05-20 08:24:32,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-20 08:24:32,604 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-20 08:24:32,608 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-20 08:24:32,608 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-20 08:24:32,611 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-20 08:24:32,611 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,612 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8809882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32, skipping insertion in model container [2023-05-20 08:24:32,613 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,618 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-20 08:24:32,636 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-20 08:24:32,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-05-20 08:24:32,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 08:24:32,817 INFO L203 MainTranslator]: Completed pre-run [2023-05-20 08:24:32,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-three-array-sum-alt.wvr.c[2412,2425] [2023-05-20 08:24:32,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-20 08:24:32,859 INFO L208 MainTranslator]: Completed translation [2023-05-20 08:24:32,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32 WrapperNode [2023-05-20 08:24:32,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-20 08:24:32,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-20 08:24:32,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-20 08:24:32,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-20 08:24:32,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,914 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 15, calls inlined = 27, statements flattened = 271 [2023-05-20 08:24:32,914 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-20 08:24:32,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-20 08:24:32,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-20 08:24:32,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-20 08:24:32,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,926 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,940 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,942 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-20 08:24:32,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-20 08:24:32,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-20 08:24:32,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-20 08:24:32,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (1/1) ... [2023-05-20 08:24:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-20 08:24:32,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:32,988 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 08:24:33,004 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 08:24:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-20 08:24:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-20 08:24:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-20 08:24:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-20 08:24:33,033 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-20 08:24:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-20 08:24:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-20 08:24:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-20 08:24:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-20 08:24:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-20 08:24:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-20 08:24:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-20 08:24:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-20 08:24:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-20 08:24:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-20 08:24:33,036 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 08:24:33,125 INFO L235 CfgBuilder]: Building ICFG [2023-05-20 08:24:33,127 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-20 08:24:33,589 INFO L276 CfgBuilder]: Performing block encoding [2023-05-20 08:24:33,611 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-20 08:24:33,611 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-20 08:24:33,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 08:24:33 BoogieIcfgContainer [2023-05-20 08:24:33,614 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-20 08:24:33,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-20 08:24:33,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-20 08:24:33,621 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-20 08:24:33,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.05 08:24:32" (1/3) ... [2023-05-20 08:24:33,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332089e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 08:24:33, skipping insertion in model container [2023-05-20 08:24:33,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.05 08:24:32" (2/3) ... [2023-05-20 08:24:33,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332089e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.05 08:24:33, skipping insertion in model container [2023-05-20 08:24:33,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.05 08:24:33" (3/3) ... [2023-05-20 08:24:33,625 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-three-array-sum-alt.wvr.c [2023-05-20 08:24:33,631 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-20 08:24:33,640 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-20 08:24:33,640 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-20 08:24:33,640 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-20 08:24:33,771 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-20 08:24:33,827 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 08:24:33,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-20 08:24:33,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:33,828 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 08:24:33,830 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 08:24:33,856 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-20 08:24:33,872 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-20 08:24:33,878 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;@64729bfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-20 08:24:33,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-20 08:24:34,096 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:34,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:34,100 INFO L85 PathProgramCache]: Analyzing trace with hash 902999447, now seen corresponding path program 1 times [2023-05-20 08:24:34,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:34,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556768260] [2023-05-20 08:24:34,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:34,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:34,453 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 08:24:34,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:34,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556768260] [2023-05-20 08:24:34,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556768260] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 08:24:34,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 08:24:34,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-20 08:24:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413802373] [2023-05-20 08:24:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:24:34,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-20 08:24:34,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-20 08:24:34,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-20 08:24:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:34,482 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:34,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 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 08:24:34,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:34,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:34,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-20 08:24:34,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:34,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:34,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1529966586, now seen corresponding path program 1 times [2023-05-20 08:24:34,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:34,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549578438] [2023-05-20 08:24:34,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:34,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:35,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-05-20 08:24:35,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:35,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549578438] [2023-05-20 08:24:35,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549578438] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-20 08:24:35,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-20 08:24:35,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-20 08:24:35,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446202365] [2023-05-20 08:24:35,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:24:35,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 08:24:35,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:35,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 08:24:35,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-20 08:24:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:35,083 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:35,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.285714285714285) internal successors, (205), 7 states have internal predecessors, (205), 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 08:24:35,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:35,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:35,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:35,325 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-20 08:24:35,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:35,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash -950453085, now seen corresponding path program 1 times [2023-05-20 08:24:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:35,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129156082] [2023-05-20 08:24:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:35,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:35,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129156082] [2023-05-20 08:24:35,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129156082] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:35,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139170537] [2023-05-20 08:24:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:35,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:35,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:35,644 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 08:24:35,665 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 08:24:35,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:35,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 08:24:35,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:24:36,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:36,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:24:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:36,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139170537] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:36,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 08:24:36,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-20 08:24:36,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663622764] [2023-05-20 08:24:36,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:24:36,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 08:24:36,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:36,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 08:24:36,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 08:24:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:36,319 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:36,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.285714285714285) internal successors, (226), 7 states have internal predecessors, (226), 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 08:24:36,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:36,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:36,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:36,718 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-05-20 08:24:36,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-05-20 08:24:36,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:36,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash -478342421, now seen corresponding path program 1 times [2023-05-20 08:24:36,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:36,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905714655] [2023-05-20 08:24:36,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:37,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905714655] [2023-05-20 08:24:37,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905714655] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:37,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537732657] [2023-05-20 08:24:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:37,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:37,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:37,169 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 08:24:37,171 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 08:24:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:37,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 08:24:37,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:24:37,561 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:37,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:24:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:37,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537732657] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:37,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 08:24:37,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-20 08:24:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240859996] [2023-05-20 08:24:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:24:37,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 08:24:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 08:24:37,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 08:24:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:37,834 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:37,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 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 08:24:37,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:37,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:37,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:37,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:38,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:38,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-05-20 08:24:38,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:38,277 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:38,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1174217631, now seen corresponding path program 1 times [2023-05-20 08:24:38,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:38,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845804639] [2023-05-20 08:24:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:38,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-20 08:24:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:38,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845804639] [2023-05-20 08:24:38,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845804639] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:38,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366371707] [2023-05-20 08:24:38,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:38,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:38,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:38,626 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 08:24:38,628 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 08:24:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:38,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-20 08:24:38,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:24:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-20 08:24:39,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:24:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-20 08:24:39,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366371707] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:39,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-20 08:24:39,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-20 08:24:39,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999552373] [2023-05-20 08:24:39,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-20 08:24:39,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-20 08:24:39,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:39,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-20 08:24:39,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-20 08:24:39,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:39,567 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:39,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.142857142857146) internal successors, (372), 7 states have internal predecessors, (372), 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 08:24:39,567 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:39,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,568 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:39,770 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 08:24:39,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:39,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:39,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1584432793, now seen corresponding path program 1 times [2023-05-20 08:24:39,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:39,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485681041] [2023-05-20 08:24:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 90 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:40,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485681041] [2023-05-20 08:24:40,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485681041] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:40,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455424027] [2023-05-20 08:24:40,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:40,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:40,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:40,538 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 08:24:40,577 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 08:24:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:40,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 08:24:40,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:24:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:41,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:24:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 91 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-20 08:24:41,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455424027] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:24:41,744 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:24:41,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-20 08:24:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045210279] [2023-05-20 08:24:41,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:24:41,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-20 08:24:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-20 08:24:41,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2023-05-20 08:24:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:41,747 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:41,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 24.583333333333332) internal successors, (590), 24 states have internal predecessors, (590), 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 08:24:41,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:41,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:41,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:41,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:41,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:41,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:24:42,275 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 08:24:42,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:42,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:42,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:42,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1710536810, now seen corresponding path program 2 times [2023-05-20 08:24:42,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:42,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131244312] [2023-05-20 08:24:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:42,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:24:42,990 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 90 proven. 10 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 08:24:42,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:24:42,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131244312] [2023-05-20 08:24:42,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131244312] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:24:42,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182505478] [2023-05-20 08:24:42,990 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-05-20 08:24:42,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:42,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:24:42,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 08:24:43,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-05-20 08:24:43,194 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-05-20 08:24:43,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:24:43,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 799 conjuncts, 10 conjunts are in the unsatisfiable core [2023-05-20 08:24:43,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:24:43,835 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 08:24:43,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:24:44,302 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 99 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-05-20 08:24:44,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182505478] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-20 08:24:44,303 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-20 08:24:44,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2023-05-20 08:24:44,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152886474] [2023-05-20 08:24:44,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-20 08:24:44,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-05-20 08:24:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-20 08:24:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-05-20 08:24:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2023-05-20 08:24:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:44,305 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-20 08:24:44,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 25.25) internal successors, (606), 24 states have internal predecessors, (606), 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 08:24:44,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:44,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,308 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:24:44,309 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-20 08:24:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-20 08:24:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-05-20 08:24:44,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-05-20 08:24:44,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-05-20 08:24:45,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:24:45,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-05-20 08:24:45,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-20 08:24:45,182 INFO L85 PathProgramCache]: Analyzing trace with hash -277484008, now seen corresponding path program 3 times [2023-05-20 08:24:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-20 08:24:45,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087584831] [2023-05-20 08:24:45,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-20 08:24:45,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-20 08:24:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-20 08:25:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-05-20 08:25:01,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-20 08:25:01,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087584831] [2023-05-20 08:25:01,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087584831] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-20 08:25:01,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852471277] [2023-05-20 08:25:01,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-05-20 08:25:01,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:25:01,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-20 08:25:01,082 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-05-20 08:25:01,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-05-20 08:25:01,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-05-20 08:25:01,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-05-20 08:25:01,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 845 conjuncts, 266 conjunts are in the unsatisfiable core [2023-05-20 08:25:01,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-20 08:25:01,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-20 08:25:04,030 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-20 08:25:04,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-05-20 08:25:06,442 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-05-20 08:25:06,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-05-20 08:25:11,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:25:11,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-05-20 08:25:13,469 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:25:13,470 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:25:13,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:25:13,486 INFO L356 Elim1Store]: treesize reduction 63, result has 19.2 percent of original size [2023-05-20 08:25:13,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 42 [2023-05-20 08:25:25,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:25:25,455 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:25:25,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-20 08:25:25,458 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:25:25,556 INFO L356 Elim1Store]: treesize reduction 206, result has 31.8 percent of original size [2023-05-20 08:25:25,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 23 case distinctions, treesize of input 142 treesize of output 189 [2023-05-20 08:25:29,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-20 08:25:29,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 20 [2023-05-20 08:25:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-20 08:25:30,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-20 08:26:45,694 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) c_~asum~0 c_~bsum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse0 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1))))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) c_~asum~0 c_~bsum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse13 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-20 08:26:46,395 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_#t~ret6#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse0 2147483647)) (<= (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4) .cse0) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_#t~ret6#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse13 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (< .cse13 (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17 1)))))))))))))) is different from false [2023-05-20 08:26:46,637 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) c_~asum~0 |c_thread2Thread1of1ForFork0_plus_#res#1| (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (not (<= .cse0 2147483647)) (<= (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4) .cse0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) c_~asum~0 |c_thread2Thread1of1ForFork0_plus_#res#1| (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< .cse13 (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17 1)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (not (<= .cse13 2147483647)))))))))))))) is different from false [2023-05-20 08:26:46,767 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_~b#1|))) (or (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1)) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse0 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_~b#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (<= .cse13 2147483647)) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-20 08:26:47,882 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_#in~b#1| |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse0 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1))))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_#in~b#1| |c_thread2Thread1of1ForFork0_plus_~a#1| c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset))))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse13 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13))))))))))))) is different from false [2023-05-20 08:26:47,987 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse24 (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (let ((.cse6 (+ c_~A~0.offset .cse24)) (.cse10 (+ c_~A~0.offset 4 .cse24))) (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse1 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (store (select .cse7 c_~C~0.base) c_~C~0.offset (+ .cse1 .cse2)))) (let ((.cse12 (store .cse7 c_~C~0.base .cse8))) (let ((.cse11 (select .cse12 c_~B~0.base)) (.cse5 (select .cse12 c_~A~0.base)) (.cse9 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse3 (select .cse5 (+ c_~A~0.offset .cse9))) (.cse4 (select .cse11 (+ .cse9 c_~B~0.offset)))) (let ((.cse0 (+ (select .cse5 .cse6) (select (select (store .cse7 c_~C~0.base (store .cse8 (+ .cse9 c_~C~0.offset) (+ .cse3 .cse4))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 (select .cse11 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_#in~a#1|))) (or (< .cse0 (+ .cse1 .cse2 c_~csum~0 .cse3 .cse4 1)) (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse0 2147483647)) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0)))))))))) (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_38| Int) (v_ArrVal_383 (Array Int Int)) (|thread2Thread1of1ForFork0_~i~1#1| Int)) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_383))) (let ((.cse14 (select (select .cse19 c_~B~0.base) c_~B~0.offset)) (.cse15 (select (select .cse19 c_~A~0.base) c_~A~0.offset))) (let ((.cse20 (store (select .cse19 c_~C~0.base) c_~C~0.offset (+ .cse14 .cse15)))) (let ((.cse23 (store .cse19 c_~C~0.base .cse20))) (let ((.cse22 (select .cse23 c_~B~0.base)) (.cse18 (select .cse23 c_~A~0.base)) (.cse21 (* |v_thread3Thread1of1ForFork1_~i~2#1_38| 4))) (let ((.cse16 (select .cse18 (+ c_~A~0.offset .cse21))) (.cse17 (select .cse22 (+ .cse21 c_~B~0.offset)))) (let ((.cse13 (+ (select .cse18 .cse6) (select (select (store .cse19 c_~C~0.base (store .cse20 (+ .cse21 c_~C~0.offset) (+ .cse16 .cse17))) c_~A~0.base) .cse10) |c_thread2Thread1of1ForFork0_plus_#in~b#1| c_~asum~0 (select .cse22 (+ (* |thread2Thread1of1ForFork0_~i~1#1| 4) c_~B~0.offset)) |c_thread2Thread1of1ForFork0_plus_#in~a#1|))) (or (not (< |v_thread3Thread1of1ForFork1_~i~2#1_38| c_~N~0)) (< |v_thread3Thread1of1ForFork1_~i~2#1_38| 1) (not (< |thread2Thread1of1ForFork0_~i~1#1| c_~N~0)) (not (<= .cse13 2147483647)) (<= (+ .cse14 .cse15 c_~csum~0 .cse16 .cse17) .cse13) (< (+ |thread2Thread1of1ForFork0_~i~1#1| 1) c_~N~0))))))))))))) is different from false [2023-05-20 08:27:00,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-20 08:27:00,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 545100 treesize of output 476332 [2023-05-20 08:27:05,460 INFO L356 Elim1Store]: treesize reduction 30, result has 88.0 percent of original size [2023-05-20 08:27:05,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 2992652 treesize of output 2351787 [2023-05-20 08:27:26,703 WARN L233 SmtUtils]: Spent 7.97s on a formula simplification that was a NOOP. DAG size: 7997 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:29:09,073 WARN L233 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 7993 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:29:24,614 WARN L233 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 7989 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:31:14,485 WARN L233 SmtUtils]: Spent 7.85s on a formula simplification that was a NOOP. DAG size: 7985 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:31:30,047 WARN L233 SmtUtils]: Spent 7.78s on a formula simplification that was a NOOP. DAG size: 7981 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:31:51,497 WARN L233 SmtUtils]: Spent 13.71s on a formula simplification. DAG size of input: 7975 DAG size of output: 7971 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:32:03,690 WARN L233 SmtUtils]: Spent 7.79s on a formula simplification. DAG size of input: 4197 DAG size of output: 4193 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:32:13,560 WARN L233 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 2269 DAG size of output: 2269 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:32:26,333 WARN L233 SmtUtils]: Spent 11.35s on a formula simplification. DAG size of input: 2267 DAG size of output: 2267 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:32:34,825 WARN L233 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 2265 DAG size of output: 2265 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:32:43,400 WARN L233 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 2265 DAG size of output: 2265 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:32:57,797 WARN L233 SmtUtils]: Spent 7.08s on a formula simplification. DAG size of input: 2263 DAG size of output: 2263 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:33:06,327 WARN L233 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 2261 DAG size of output: 2261 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:33:16,140 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 2254 DAG size of output: 2254 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:33:28,229 WARN L233 SmtUtils]: Spent 5.02s on a formula simplification. DAG size of input: 2195 DAG size of output: 2193 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:33:37,985 WARN L233 SmtUtils]: Spent 6.98s on a formula simplification. DAG size of input: 1964 DAG size of output: 1964 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:33:55,902 WARN L233 SmtUtils]: Spent 9.62s on a formula simplification. DAG size of input: 1911 DAG size of output: 1911 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:34:10,775 WARN L233 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:34:24,519 WARN L233 SmtUtils]: Spent 7.48s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:34:32,884 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:34:41,346 WARN L233 SmtUtils]: Spent 7.50s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:35:02,384 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 1627 DAG size of output: 1627 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:35:43,006 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 1520 DAG size of output: 1520 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:36:19,057 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 1522 DAG size of output: 1522 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:36:30,065 WARN L233 SmtUtils]: Spent 5.68s on a formula simplification. DAG size of input: 1520 DAG size of output: 1520 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-20 08:36:57,969 WARN L233 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 1393 DAG size of output: 1393 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-05-20 08:38:35,087 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-20 08:38:35,100 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 08:38:35,100 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 08:38:35,100 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-20 08:38:35,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-05-20 08:38:35,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-20 08:38:35,289 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2023-05-20 08:38:35,290 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-20 08:38:35,290 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-20 08:38:35,291 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-20 08:38:35,294 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-05-20 08:38:35,299 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-20 08:38:35,299 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-20 08:38:35,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.05 08:38:35 BasicIcfg [2023-05-20 08:38:35,301 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-20 08:38:35,302 INFO L158 Benchmark]: Toolchain (without parser) took 842697.95ms. Allocated memory was 183.5MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 155.5MB in the beginning and 1.2GB in the end (delta: -994.6MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2023-05-20 08:38:35,302 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 183.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-20 08:38:35,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.83ms. Allocated memory was 183.5MB in the beginning and 235.9MB in the end (delta: 52.4MB). Free memory was 155.2MB in the beginning and 205.2MB in the end (delta: -50.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. [2023-05-20 08:38:35,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.66ms. Allocated memory is still 235.9MB. Free memory was 205.2MB in the beginning and 202.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 08:38:35,303 INFO L158 Benchmark]: Boogie Preprocessor took 31.49ms. Allocated memory is still 235.9MB. Free memory was 202.5MB in the beginning and 200.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-20 08:38:35,303 INFO L158 Benchmark]: RCFGBuilder took 666.77ms. Allocated memory is still 235.9MB. Free memory was 200.4MB in the beginning and 175.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-05-20 08:38:35,303 INFO L158 Benchmark]: TraceAbstraction took 841682.98ms. Allocated memory was 235.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 174.2MB in the beginning and 1.2GB in the end (delta: -975.9MB). Peak memory consumption was 989.8MB. Max. memory is 8.0GB. [2023-05-20 08:38:35,306 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.12ms. Allocated memory is still 183.5MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.83ms. Allocated memory was 183.5MB in the beginning and 235.9MB in the end (delta: 52.4MB). Free memory was 155.2MB in the beginning and 205.2MB in the end (delta: -50.0MB). Peak memory consumption was 7.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.66ms. Allocated memory is still 235.9MB. Free memory was 205.2MB in the beginning and 202.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.49ms. Allocated memory is still 235.9MB. Free memory was 202.5MB in the beginning and 200.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 666.77ms. Allocated memory is still 235.9MB. Free memory was 200.4MB in the beginning and 175.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 841682.98ms. Allocated memory was 235.9MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 174.2MB in the beginning and 1.2GB in the end (delta: -975.9MB). Peak memory consumption was 989.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43566, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 1034, dependent conditional: 1009, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 80, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19149, independent: 19123, independent conditional: 0, independent unconditional: 19123, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19149, independent: 19121, independent conditional: 0, independent unconditional: 19121, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42657, independent: 23409, independent conditional: 0, independent unconditional: 23409, dependent: 99, dependent conditional: 11, dependent unconditional: 88, unknown: 19149, unknown conditional: 1, unknown unconditional: 19148] , Statistics on independence cache: Total cache size (in pairs): 19149, Positive cache size: 19123, Positive conditional cache size: 0, Positive unconditional cache size: 19123, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 6, Independence queries for same thread: 989 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 1081, Number of trivial persistent sets: 818, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 23624, independent: 23599, independent conditional: 0, independent unconditional: 23599, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 43566, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 1034, dependent conditional: 1009, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 42577, independent: 42532, independent conditional: 18933, independent unconditional: 23599, dependent: 45, dependent conditional: 20, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 80, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 42657, independent: 42532, independent conditional: 0, independent unconditional: 42532, dependent: 125, dependent conditional: 12, dependent unconditional: 113, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 19149, independent: 19123, independent conditional: 0, independent unconditional: 19123, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 19149, independent: 19121, independent conditional: 0, independent unconditional: 19121, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 26, dependent conditional: 1, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 96, independent: 38, independent conditional: 0, independent unconditional: 38, dependent: 58, dependent conditional: 3, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 42657, independent: 23409, independent conditional: 0, independent unconditional: 23409, dependent: 99, dependent conditional: 11, dependent unconditional: 88, unknown: 19149, unknown conditional: 1, unknown unconditional: 19148] , Statistics on independence cache: Total cache size (in pairs): 19149, Positive cache size: 19123, Positive conditional cache size: 0, Positive unconditional cache size: 19123, Negative cache size: 26, Negative conditional cache size: 1, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 68, Maximal queried relation: 6, Independence queries for same thread: 989 - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 454 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 481 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 841.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 2.4s, 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: 65, 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.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 3738 NumberOfCodeBlocks, 3738 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 5400 ConstructedInterpolants, 0 QuantifiedInterpolants, 14987 SizeOfPredicates, 33 NumberOfNonLiveVariables, 3291 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 929/961 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