/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE --traceabstraction.maximal.amount.of.steps.the.threads.are.allowed.to.take.successively 1 --traceabstraction.enable.heuristic.with.loops.as.step.type false --traceabstraction.considered.threads.and.their.maximal.amount.of.steps '"3,2 1,1 2,2"' --traceabstraction.defines.what.statements.are.considered.a.step.in.por GLOBAL_READ_WRITE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.orders-218013a [2023-05-04 10:03:15,830 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-05-04 10:03:15,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-05-04 10:03:15,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-05-04 10:03:15,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-05-04 10:03:15,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-05-04 10:03:15,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-05-04 10:03:15,883 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-05-04 10:03:15,884 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-05-04 10:03:15,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-05-04 10:03:15,891 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-05-04 10:03:15,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-05-04 10:03:15,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-05-04 10:03:15,895 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-05-04 10:03:15,898 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-05-04 10:03:15,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-05-04 10:03:15,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-05-04 10:03:15,901 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-05-04 10:03:15,902 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-05-04 10:03:15,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-05-04 10:03:15,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-05-04 10:03:15,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-05-04 10:03:15,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-05-04 10:03:15,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-05-04 10:03:15,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-05-04 10:03:15,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-05-04 10:03:15,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-05-04 10:03:15,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-05-04 10:03:15,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-05-04 10:03:15,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-05-04 10:03:15,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-05-04 10:03:15,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-05-04 10:03:15,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-05-04 10:03:15,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-05-04 10:03:15,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-05-04 10:03:15,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-05-04 10:03:15,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-05-04 10:03:15,925 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-05-04 10:03:15,925 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-05-04 10:03:15,926 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-05-04 10:03:15,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-05-04 10:03:15,927 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2023-05-04 10:03:15,954 INFO L113 SettingsManager]: Loading preferences was successful [2023-05-04 10:03:15,955 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-05-04 10:03:15,955 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-05-04 10:03:15,955 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-05-04 10:03:15,956 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-05-04 10:03:15,956 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-05-04 10:03:15,957 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-05-04 10:03:15,957 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-05-04 10:03:15,957 INFO L138 SettingsManager]: * Use SBE=true [2023-05-04 10:03:15,957 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-05-04 10:03:15,958 INFO L138 SettingsManager]: * sizeof long=4 [2023-05-04 10:03:15,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-05-04 10:03:15,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * sizeof long double=12 [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * Use constant arrays=true [2023-05-04 10:03:15,959 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-05-04 10:03:15,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-05-04 10:03:15,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-05-04 10:03:15,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-05-04 10:03:15,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-05-04 10:03:15,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 10:03:15,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-05-04 10:03:15,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-05-04 10:03:15,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-05-04 10:03:15,961 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-05-04 10:03:15,961 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-05-04 10:03:15,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-05-04 10:03:15,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-05-04 10:03:15,962 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-05-04 10:03:15,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-05-04 10:03:15,962 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-05-04 10:03:15,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Maximal amount of steps the threads are allowed to take successively -> 1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Enable heuristic with loops as step type -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Considered threads and their maximal amount of steps -> 3,2 1,1 2,2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Defines what statements are considered a step in POR -> GLOBAL_READ_WRITE [2023-05-04 10:03:16,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-05-04 10:03:16,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-05-04 10:03:16,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-05-04 10:03:16,237 INFO L271 PluginConnector]: Initializing CDTParser... [2023-05-04 10:03:16,237 INFO L275 PluginConnector]: CDTParser initialized [2023-05-04 10:03:16,238 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-05-04 10:03:16,297 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6200adb26/3125c86a1b014d8a9993e7925225d7f4/FLAGf064c1a26 [2023-05-04 10:03:16,669 INFO L306 CDTParser]: Found 1 translation units. [2023-05-04 10:03:16,670 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-sum.wvr.c [2023-05-04 10:03:16,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6200adb26/3125c86a1b014d8a9993e7925225d7f4/FLAGf064c1a26 [2023-05-04 10:03:17,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6200adb26/3125c86a1b014d8a9993e7925225d7f4 [2023-05-04 10:03:17,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-05-04 10:03:17,079 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-05-04 10:03:17,081 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-05-04 10:03:17,081 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-05-04 10:03:17,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-05-04 10:03:17,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e1ac8d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17, skipping insertion in model container [2023-05-04 10:03:17,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-05-04 10:03:17,113 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-05-04 10:03:17,282 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-three-array-sum.wvr.c[2691,2704] [2023-05-04 10:03:17,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 10:03:17,294 INFO L203 MainTranslator]: Completed pre-run [2023-05-04 10:03:17,317 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-three-array-sum.wvr.c[2691,2704] [2023-05-04 10:03:17,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-05-04 10:03:17,343 INFO L208 MainTranslator]: Completed translation [2023-05-04 10:03:17,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17 WrapperNode [2023-05-04 10:03:17,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-05-04 10:03:17,345 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-05-04 10:03:17,345 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-05-04 10:03:17,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-05-04 10:03:17,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,368 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,390 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 12, statements flattened = 150 [2023-05-04 10:03:17,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-05-04 10:03:17,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-05-04 10:03:17,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-05-04 10:03:17,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-05-04 10:03:17,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,414 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,439 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-05-04 10:03:17,443 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-05-04 10:03:17,443 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-05-04 10:03:17,443 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-05-04 10:03:17,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (1/1) ... [2023-05-04 10:03:17,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-05-04 10:03:17,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:03:17,485 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-04 10:03:17,488 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-04 10:03:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-05-04 10:03:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-05-04 10:03:17,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-05-04 10:03:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-05-04 10:03:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-05-04 10:03:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-05-04 10:03:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-05-04 10:03:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-05-04 10:03:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-05-04 10:03:17,513 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-05-04 10:03:17,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-05-04 10:03:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-05-04 10:03:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-05-04 10:03:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-05-04 10:03:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-05-04 10:03:17,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-05-04 10:03:17,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-05-04 10:03:17,515 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2023-05-04 10:03:17,604 INFO L235 CfgBuilder]: Building ICFG [2023-05-04 10:03:17,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-05-04 10:03:17,965 INFO L276 CfgBuilder]: Performing block encoding [2023-05-04 10:03:18,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-05-04 10:03:18,012 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2023-05-04 10:03:18,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 10:03:18 BoogieIcfgContainer [2023-05-04 10:03:18,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-05-04 10:03:18,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-05-04 10:03:18,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-05-04 10:03:18,025 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-05-04 10:03:18,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 10:03:17" (1/3) ... [2023-05-04 10:03:18,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eea7313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 10:03:18, skipping insertion in model container [2023-05-04 10:03:18,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:03:17" (2/3) ... [2023-05-04 10:03:18,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@eea7313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 10:03:18, skipping insertion in model container [2023-05-04 10:03:18,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 10:03:18" (3/3) ... [2023-05-04 10:03:18,027 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2023-05-04 10:03:18,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-05-04 10:03:18,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-05-04 10:03:18,044 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-05-04 10:03:18,045 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-05-04 10:03:18,146 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-05-04 10:03:18,194 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:03:18,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-05-04 10:03:18,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:03:18,196 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-04 10:03:18,197 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-04 10:03:18,228 INFO L162 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-05-04 10:03:18,244 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-05-04 10:03:18,250 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;@7c21690a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-05-04 10:03:18,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-05-04 10:03:18,451 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-04 10:03:18,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:03:18,455 INFO L85 PathProgramCache]: Analyzing trace with hash 852264550, now seen corresponding path program 1 times [2023-05-04 10:03:18,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:03:18,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899121144] [2023-05-04 10:03:18,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:18,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:03:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 10:03:18,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:03:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899121144] [2023-05-04 10:03:18,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899121144] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:03:18,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:03:18,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-05-04 10:03:18,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382283776] [2023-05-04 10:03:18,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:03:18,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-05-04 10:03:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:03:18,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-05-04 10:03:18,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-05-04 10:03:18,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:18,819 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:03:18,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-04 10:03:18,820 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:18,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-05-04 10:03:18,861 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-04 10:03:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:03:18,862 INFO L85 PathProgramCache]: Analyzing trace with hash -723232476, now seen corresponding path program 1 times [2023-05-04 10:03:18,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:03:18,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665618403] [2023-05-04 10:03:18,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:18,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:03:18,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:19,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-05-04 10:03:19,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:03:19,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665618403] [2023-05-04 10:03:19,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665618403] provided 1 perfect and 0 imperfect interpolant sequences [2023-05-04 10:03:19,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-05-04 10:03:19,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-05-04 10:03:19,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587925478] [2023-05-04 10:03:19,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:03:19,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 10:03:19,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:03:19,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 10:03:19,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-05-04 10:03:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:19,339 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:03:19,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 7 states have internal predecessors, (164), 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-04 10:03:19,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:19,339 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:19,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-05-04 10:03:19,556 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-04 10:03:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:03:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash 112351791, now seen corresponding path program 1 times [2023-05-04 10:03:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:03:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3735380] [2023-05-04 10:03:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:03:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:19,864 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 10:03:19,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:03:19,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3735380] [2023-05-04 10:03:19,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3735380] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 10:03:19,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460855998] [2023-05-04 10:03:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:19,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 10:03:19,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:03:19,871 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-04 10:03:19,889 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-04 10:03:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:19,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 10:03:20,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 10:03:20,196 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 10:03:20,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 10:03:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-05-04 10:03:20,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460855998] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 10:03:20,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 10:03:20,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 10:03:20,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244171434] [2023-05-04 10:03:20,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:03:20,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 10:03:20,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:03:20,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 10:03:20,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 10:03:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:20,457 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:03:20,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.142857142857142) internal successors, (183), 7 states have internal predecessors, (183), 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-04 10:03:20,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:20,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:20,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:20,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:20,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:20,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-05-04 10:03:20,829 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-04 10:03:20,829 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-04 10:03:20,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:03:20,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1803529583, now seen corresponding path program 1 times [2023-05-04 10:03:20,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:03:20,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470563680] [2023-05-04 10:03:20,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:20,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:03:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:21,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 10:03:21,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:03:21,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470563680] [2023-05-04 10:03:21,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470563680] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 10:03:21,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006184619] [2023-05-04 10:03:21,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:21,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 10:03:21,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:03:21,065 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-04 10:03:21,088 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-04 10:03:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:21,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 10:03:21,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 10:03:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 10:03:21,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 10:03:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-05-04 10:03:21,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006184619] provided 1 perfect and 1 imperfect interpolant sequences [2023-05-04 10:03:21,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-05-04 10:03:21,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-05-04 10:03:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056165319] [2023-05-04 10:03:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-05-04 10:03:21,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-05-04 10:03:21,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:03:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-05-04 10:03:21,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-05-04 10:03:21,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:21,594 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:03:21,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.285714285714285) internal successors, (191), 7 states have internal predecessors, (191), 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-04 10:03:21,594 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:21,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:21,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:21,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:21,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:21,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-05-04 10:03:21,941 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-04 10:03:21,941 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-04 10:03:21,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:03:21,942 INFO L85 PathProgramCache]: Analyzing trace with hash -93945496, now seen corresponding path program 1 times [2023-05-04 10:03:21,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:03:21,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002882891] [2023-05-04 10:03:21,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:03:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:22,289 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 10:03:22,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:03:22,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002882891] [2023-05-04 10:03:22,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002882891] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 10:03:22,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929234962] [2023-05-04 10:03:22,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:22,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 10:03:22,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:03:22,291 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-04 10:03:22,313 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-04 10:03:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:22,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 6 conjunts are in the unsatisfiable core [2023-05-04 10:03:22,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 10:03:22,539 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 10:03:22,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 10:03:22,620 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-05-04 10:03:22,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929234962] provided 0 perfect and 2 imperfect interpolant sequences [2023-05-04 10:03:22,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-05-04 10:03:22,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2023-05-04 10:03:22,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844737349] [2023-05-04 10:03:22,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-05-04 10:03:22,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-05-04 10:03:22,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-05-04 10:03:22,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-05-04 10:03:22,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-05-04 10:03:22,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:22,623 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-05-04 10:03:22,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.833333333333332) internal successors, (250), 12 states have internal predecessors, (250), 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-04 10:03:22,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:22,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:22,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:22,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:22,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-05-04 10:03:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-05-04 10:03:22,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-05-04 10:03:22,759 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-04 10:03:22,964 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-04 10:03:22,965 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-04 10:03:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-05-04 10:03:22,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2095189926, now seen corresponding path program 1 times [2023-05-04 10:03:22,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-05-04 10:03:22,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435048139] [2023-05-04 10:03:22,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:22,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-05-04 10:03:23,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-05-04 10:03:27,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-05-04 10:03:27,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435048139] [2023-05-04 10:03:27,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435048139] provided 0 perfect and 1 imperfect interpolant sequences [2023-05-04 10:03:27,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58624666] [2023-05-04 10:03:27,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-05-04 10:03:27,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-05-04 10:03:27,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-05-04 10:03:27,405 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-04 10:03:27,426 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-04 10:03:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-05-04 10:03:27,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 104 conjunts are in the unsatisfiable core [2023-05-04 10:03:27,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-05-04 10:03:27,728 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-04 10:03:28,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:28,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2023-05-04 10:03:28,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 10:03:29,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:29,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:29,059 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-05-04 10:03:29,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2023-05-04 10:03:29,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-05-04 10:03:30,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:30,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:30,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:30,579 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-05-04 10:03:30,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-05-04 10:03:30,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 10:03:31,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 10:03:32,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-05-04 10:03:32,332 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-05-04 10:03:32,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2023-05-04 10:03:32,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:32,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:32,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-05-04 10:03:32,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2023-05-04 10:03:33,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-05-04 10:03:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-05-04 10:03:33,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-05-04 10:03:33,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_253 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse1 (select (select .cse2 c_~B~0.base) (+ (* c_thread1Thread1of1ForFork0_~i~0 4) c_~B~0.offset))) (.cse0 (select (select .cse2 c_~C~0.base) c_~C~0.offset))) (= (+ .cse0 (* 4294967296 (div (+ c_~asum~0 c_~bsum~0 |c_thread1Thread1of1ForFork0_#t~mem2| .cse1) 4294967296)) c_~csum~0) (+ c_~asum~0 c_~bsum~0 |c_thread1Thread1of1ForFork0_#t~mem2| .cse1 (* (div (+ .cse0 c_~csum~0) 4294967296) 4294967296)))))) is different from false [2023-05-04 10:03:39,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse3 (store (store |c_#memory_int| c_~C~0.base (store (select |c_#memory_int| c_~C~0.base) ~C~0.offset (+ (select .cse4 c_~A~0.offset) (select (select |c_#memory_int| c_~B~0.base) c_~B~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253)) (.cse5 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse0 (select (select .cse3 c_~B~0.base) (+ .cse5 c_~B~0.offset))) (.cse1 (select .cse4 (+ c_~A~0.offset .cse5))) (.cse2 (select (select .cse3 c_~C~0.base) ~C~0.offset))) (= (+ (* (div (+ .cse0 c_~asum~0 c_~bsum~0 .cse1) 4294967296) 4294967296) .cse2 c_~csum~0) (+ .cse0 c_~asum~0 c_~bsum~0 .cse1 (* (div (+ .cse2 c_~csum~0) 4294967296) 4294967296))))))) is different from false [2023-05-04 10:03:39,379 WARN L833 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse4 (select .cse6 c_~A~0.base))) (let ((.cse3 (store (store .cse6 c_~C~0.base (store (select .cse6 c_~C~0.base) ~C~0.offset (+ (select (select .cse6 c_~B~0.base) c_~B~0.offset) (select .cse4 c_~A~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253)) (.cse5 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse1 (select (select .cse3 c_~B~0.base) (+ .cse5 c_~B~0.offset))) (.cse2 (select .cse4 (+ c_~A~0.offset .cse5))) (.cse0 (select (select .cse3 c_~C~0.base) ~C~0.offset))) (= (+ .cse0 (* (div (+ .cse1 c_~asum~0 c_~bsum~0 .cse2) 4294967296) 4294967296) c_~csum~0) (+ .cse1 c_~asum~0 c_~bsum~0 .cse2 (* (div (+ .cse0 c_~csum~0) 4294967296) 4294967296)))))))) is different from false [2023-05-04 10:03:39,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) ~C~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) .cse2))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse0 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse1 (select (select .cse3 c_~C~0.base) ~C~0.offset))) (= (+ c_~asum~0 c_~bsum~0 .cse0 (* (div (+ .cse1 c_~csum~0) 4294967296) 4294967296) .cse2) (+ (* (div (+ c_~asum~0 c_~bsum~0 .cse0 .cse2) 4294967296) 4294967296) .cse1 c_~csum~0))))))) is different from false [2023-05-04 10:03:39,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 c_~C~0.base (store (select .cse4 c_~C~0.base) ~C~0.offset (+ .cse2 (select (select .cse4 c_~B~0.base) c_~B~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse1 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse0 (select (select .cse3 c_~C~0.base) ~C~0.offset))) (= (+ (* (div (+ c_~csum~0 .cse0) 4294967296) 4294967296) c_~asum~0 c_~bsum~0 .cse1 .cse2) (+ (* (div (+ c_~asum~0 c_~bsum~0 .cse1 .cse2) 4294967296) 4294967296) c_~csum~0 .cse0))))))) is different from false [2023-05-04 10:03:39,566 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~ret12#1.base|) ~C~0.offset (+ .cse2 (select (select .cse4 c_~B~0.base) c_~B~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.base|) ~C~0.offset)) (.cse1 (select (select .cse3 c_~B~0.base) c_~B~0.offset))) (= (+ .cse0 c_~csum~0 (* (div (+ c_~asum~0 c_~bsum~0 .cse1 .cse2) 4294967296) 4294967296)) (+ (* (div (+ .cse0 c_~csum~0) 4294967296) 4294967296) c_~asum~0 c_~bsum~0 .cse1 .cse2))))))) is different from false [2023-05-04 10:03:39,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base| (store (select .cse4 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) ~C~0.offset (+ .cse2 (select (select .cse4 c_~B~0.base) c_~B~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse1 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) ~C~0.offset))) (= (+ .cse0 c_~csum~0 (* 4294967296 (div (+ .cse1 c_~asum~0 c_~bsum~0 .cse2) 4294967296))) (+ .cse1 c_~asum~0 c_~bsum~0 .cse2 (* (div (+ .cse0 c_~csum~0) 4294967296) 4294967296)))))))) is different from false [2023-05-04 10:03:39,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse1 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (store (select .cse4 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) ~C~0.offset (+ .cse1 (select (select .cse4 c_~B~0.base) c_~B~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse0 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) ~C~0.offset))) (= (+ (* 4294967296 (div (+ .cse0 c_~asum~0 c_~bsum~0 .cse1) 4294967296)) .cse2 c_~csum~0) (+ .cse0 c_~asum~0 c_~bsum~0 (* (div (+ .cse2 c_~csum~0) 4294967296) 4294967296) .cse1))))))) is different from false [2023-05-04 10:03:39,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse1 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base| (store (select .cse4 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) ~C~0.offset (+ (select (select .cse4 c_~B~0.base) c_~B~0.offset) .cse1))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse0 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) ~C~0.offset))) (= (+ (* (div (+ .cse0 c_~asum~0 c_~bsum~0 .cse1) 4294967296) 4294967296) c_~csum~0 .cse2) (+ .cse0 c_~asum~0 c_~bsum~0 (* (div (+ c_~csum~0 .cse2) 4294967296) 4294967296) .cse1))))))) is different from false [2023-05-04 10:03:39,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_249 (Array Int Int)) (v_ArrVal_248 (Array Int Int)) (~C~0.offset Int) (v_ArrVal_250 (Array Int Int)) (v_ArrVal_253 (Array Int Int))) (let ((.cse4 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base| v_ArrVal_248) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_249) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_250))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base| (store (select .cse4 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base|) ~C~0.offset (+ .cse2 (select (select .cse4 c_~B~0.base) c_~B~0.offset)))) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_253))) (let ((.cse1 (select (select .cse3 c_~B~0.base) c_~B~0.offset)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_create_fresh_uint_array_#t~malloc22#1.base|) ~C~0.offset))) (= (+ .cse0 (* (div (+ .cse1 .cse2 c_~asum~0 c_~bsum~0) 4294967296) 4294967296) c_~csum~0) (+ .cse1 .cse2 c_~asum~0 c_~bsum~0 (* (div (+ .cse0 c_~csum~0) 4294967296) 4294967296)))))))) is different from false [2023-05-04 10:03:46,767 INFO L356 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-05-04 10:03:46,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 871 treesize of output 330 [2023-05-04 10:03:46,787 INFO L173 IndexEqualityManager]: detected equality via solver [2023-05-04 10:03:55,712 WARN L233 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-05-04 10:03:55,712 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 10:03:55,714 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 6275088 treesize of output 5898284 [2023-05-04 10:04:04,171 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 1384 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:04:04,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2949115 treesize of output 2883579 [2023-05-04 10:04:12,659 WARN L233 SmtUtils]: Spent 8.39s on a formula simplification that was a NOOP. DAG size: 1383 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:04:12,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 10:04:12,754 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 5832694 treesize of output 5578750 [2023-05-04 10:04:21,064 WARN L233 SmtUtils]: Spent 8.31s on a formula simplification that was a NOOP. DAG size: 1385 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:04:21,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 10:04:21,151 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 5578742 treesize of output 5054462 [2023-05-04 10:04:29,533 WARN L233 SmtUtils]: Spent 8.38s on a formula simplification that was a NOOP. DAG size: 1388 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:04:29,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-05-04 10:04:29,625 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 5054454 treesize of output 4562942 [2023-05-04 10:04:38,055 WARN L233 SmtUtils]: Spent 8.43s on a formula simplification that was a NOOP. DAG size: 1390 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:05:16,293 WARN L233 SmtUtils]: Spent 20.89s on a formula simplification. DAG size of input: 1310 DAG size of output: 1310 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:05:33,787 WARN L233 SmtUtils]: Spent 13.45s on a formula simplification. DAG size of input: 1308 DAG size of output: 1308 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:05:57,094 WARN L233 SmtUtils]: Spent 19.15s on a formula simplification. DAG size of input: 1308 DAG size of output: 1308 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:06:24,961 WARN L233 SmtUtils]: Spent 14.34s on a formula simplification. DAG size of input: 1308 DAG size of output: 1308 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:06:33,141 WARN L233 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 1028 DAG size of output: 1028 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:08:58,910 WARN L233 SmtUtils]: Spent 5.10s on a formula simplification that was a NOOP. DAG size: 2911 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:09:34,240 WARN L233 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 3223 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:10:00,467 WARN L233 SmtUtils]: Spent 8.03s on a formula simplification that was a NOOP. DAG size: 3551 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:10:32,363 WARN L233 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 3548 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:10:59,573 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 3219 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:11:46,189 WARN L233 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 3551 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:12:12,905 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 3218 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:12:42,637 WARN L233 SmtUtils]: Spent 10.93s on a formula simplification that was a NOOP. DAG size: 3896 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:13:21,548 WARN L233 SmtUtils]: Spent 11.66s on a formula simplification that was a NOOP. DAG size: 4256 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:14:00,035 WARN L233 SmtUtils]: Spent 7.88s on a formula simplification that was a NOOP. DAG size: 3550 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:14:30,008 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 3552 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:14:56,444 WARN L233 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 3220 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:15:15,939 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3221 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:15:37,635 WARN L233 SmtUtils]: Spent 9.54s on a formula simplification that was a NOOP. DAG size: 3895 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:16:10,822 WARN L233 SmtUtils]: Spent 7.87s on a formula simplification that was a NOOP. DAG size: 3549 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:16:31,836 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 3218 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:16:50,241 WARN L233 SmtUtils]: Spent 7.82s on a formula simplification that was a NOOP. DAG size: 3548 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-05-04 10:17:33,840 WARN L233 SmtUtils]: Spent 5.99s on a formula simplification that was a NOOP. DAG size: 3223 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-05-04 10:17:39,179 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-05-04 10:17:39,179 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-04 10:17:39,190 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-04 10:17:40,100 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-05-04 10:17:40,124 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-04 10:17:40,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2023-05-04 10:17:40,240 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-05-04 10:17:40,316 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-04 10:17:40,317 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 194 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 1521 xjuncts wrt. a ∨-1521-1 context. [2023-05-04 10:17:40,318 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-05-04 10:17:40,319 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-05-04 10:17:40,319 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-05-04 10:17:40,322 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-05-04 10:17:40,324 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-05-04 10:17:40,324 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-05-04 10:17:40,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 10:17:40 BasicIcfg [2023-05-04 10:17:40,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-05-04 10:17:40,327 INFO L158 Benchmark]: Toolchain (without parser) took 863248.14ms. Allocated memory was 197.1MB in the beginning and 1.0GB in the end (delta: 807.4MB). Free memory was 164.4MB in the beginning and 528.8MB in the end (delta: -364.5MB). Peak memory consumption was 621.0MB. Max. memory is 8.0GB. [2023-05-04 10:17:40,327 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-05-04 10:17:40,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.93ms. Allocated memory was 197.1MB in the beginning and 278.9MB in the end (delta: 81.8MB). Free memory was 164.4MB in the beginning and 245.5MB in the end (delta: -81.1MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2023-05-04 10:17:40,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.91ms. Allocated memory is still 278.9MB. Free memory was 245.5MB in the beginning and 243.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 10:17:40,328 INFO L158 Benchmark]: Boogie Preprocessor took 51.83ms. Allocated memory is still 278.9MB. Free memory was 243.4MB in the beginning and 241.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-05-04 10:17:40,328 INFO L158 Benchmark]: RCFGBuilder took 571.15ms. Allocated memory is still 278.9MB. Free memory was 241.6MB in the beginning and 220.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-05-04 10:17:40,328 INFO L158 Benchmark]: TraceAbstraction took 862305.04ms. Allocated memory was 278.9MB in the beginning and 1.0GB in the end (delta: 725.6MB). Free memory was 219.2MB in the beginning and 528.8MB in the end (delta: -309.6MB). Peak memory consumption was 595.6MB. Max. memory is 8.0GB. [2023-05-04 10:17:40,329 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.11ms. Allocated memory is still 197.1MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.93ms. Allocated memory was 197.1MB in the beginning and 278.9MB in the end (delta: 81.8MB). Free memory was 164.4MB in the beginning and 245.5MB in the end (delta: -81.1MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.91ms. Allocated memory is still 278.9MB. Free memory was 245.5MB in the beginning and 243.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.83ms. Allocated memory is still 278.9MB. Free memory was 243.4MB in the beginning and 241.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 571.15ms. Allocated memory is still 278.9MB. Free memory was 241.6MB in the beginning and 220.3MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 862305.04ms. Allocated memory was 278.9MB in the beginning and 1.0GB in the end (delta: 725.6MB). Free memory was 219.2MB in the beginning and 528.8MB in the end (delta: -309.6MB). Peak memory consumption was 595.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3165, independent: 2867, independent conditional: 479, independent unconditional: 2388, dependent: 298, dependent conditional: 276, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2895, independent: 2867, independent conditional: 479, independent unconditional: 2388, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2895, independent: 2867, independent conditional: 479, independent unconditional: 2388, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2905, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 38, dependent conditional: 10, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2905, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2905, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2085, independent: 2063, independent conditional: 0, independent unconditional: 2063, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2085, independent: 2061, independent conditional: 0, independent unconditional: 2061, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2905, independent: 804, independent conditional: 0, independent unconditional: 804, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2085, unknown conditional: 0, unknown unconditional: 2085] , Statistics on independence cache: Total cache size (in pairs): 2085, Positive cache size: 2063, Positive conditional cache size: 0, Positive unconditional cache size: 2063, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 3, Independence queries for same thread: 270 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.2s, Number of persistent set computation: 241, Number of trivial persistent sets: 207, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2410, independent: 2388, independent conditional: 0, independent unconditional: 2388, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 3165, independent: 2867, independent conditional: 479, independent unconditional: 2388, dependent: 298, dependent conditional: 276, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2895, independent: 2867, independent conditional: 479, independent unconditional: 2388, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2895, independent: 2867, independent conditional: 479, independent unconditional: 2388, dependent: 28, dependent conditional: 6, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2905, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 38, dependent conditional: 10, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2905, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2905, independent: 2867, independent conditional: 0, independent unconditional: 2867, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2085, independent: 2063, independent conditional: 0, independent unconditional: 2063, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2085, independent: 2061, independent conditional: 0, independent unconditional: 2061, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 24, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 22, dependent conditional: 0, dependent unconditional: 22, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 105, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2905, independent: 804, independent conditional: 0, independent unconditional: 804, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 2085, unknown conditional: 0, unknown unconditional: 2085] , Statistics on independence cache: Total cache size (in pairs): 2085, Positive cache size: 2063, Positive conditional cache size: 0, Positive unconditional cache size: 2063, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 10, Maximal queried relation: 3, Independence queries for same thread: 270 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 194 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 1521 xjuncts wrt. a ∨-1521-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PartialOrderCegarLoop was analyzing trace of length 194 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 1521 xjuncts wrt. a ∨-1521-1 context. - TimeoutResultAtElement [Line: 95]: 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 194 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 1521 xjuncts wrt. a ∨-1521-1 context. - TimeoutResultAtElement [Line: 96]: 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 194 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 1521 xjuncts wrt. a ∨-1521-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 246 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 862.1s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1512 NumberOfCodeBlocks, 1512 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 2084 ConstructedInterpolants, 0 QuantifiedInterpolants, 4336 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1323 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 140/147 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