/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-VarAbsGlobalSyntactic.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false -i ../../../trunk/examples/svcomp/pthread/queue_ok_longest.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-44940e9-m [2022-11-10 10:42:29,708 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-10 10:42:29,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-10 10:42:29,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-10 10:42:29,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-10 10:42:29,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-10 10:42:29,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-10 10:42:29,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-10 10:42:29,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-10 10:42:29,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-10 10:42:29,763 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-10 10:42:29,765 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-10 10:42:29,765 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-10 10:42:29,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-10 10:42:29,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-10 10:42:29,769 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-10 10:42:29,770 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-10 10:42:29,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-10 10:42:29,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-10 10:42:29,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-10 10:42:29,780 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-10 10:42:29,781 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-10 10:42:29,782 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-10 10:42:29,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-10 10:42:29,790 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-10 10:42:29,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-10 10:42:29,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-10 10:42:29,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-10 10:42:29,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-10 10:42:29,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-10 10:42:29,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-10 10:42:29,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-10 10:42:29,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-10 10:42:29,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-10 10:42:29,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-10 10:42:29,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-10 10:42:29,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-10 10:42:29,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-10 10:42:29,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-10 10:42:29,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-10 10:42:29,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-10 10:42:29,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder-VarAbsGlobalSyntactic.epf [2022-11-10 10:42:29,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-10 10:42:29,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-10 10:42:29,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-10 10:42:29,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-10 10:42:29,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-10 10:42:29,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-10 10:42:29,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-10 10:42:29,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-10 10:42:29,830 INFO L138 SettingsManager]: * Use SBE=true [2022-11-10 10:42:29,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-10 10:42:29,831 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-10 10:42:29,831 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-10 10:42:29,831 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-10 10:42:29,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-10 10:42:29,832 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-10 10:42:29,832 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-10 10:42:29,832 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-10 10:42:29,832 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-10 10:42:29,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-10 10:42:29,833 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-10 10:42:29,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-10 10:42:29,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-10 10:42:29,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-10 10:42:29,833 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-10 10:42:29,833 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-10 10:42:29,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 10:42:29,834 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-10 10:42:29,834 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-10 10:42:29,834 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-10 10:42:29,834 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-10 10:42:29,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-10 10:42:29,835 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-10 10:42:29,835 INFO L138 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2022-11-10 10:42:29,835 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-10 10:42:29,835 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-10 10:42:29,836 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-10 10:42:29,836 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-10 10:42:29,836 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-10 10:42:29,836 INFO L138 SettingsManager]: * Independence relation used for POR in concurrent analysis=SYNTACTIC 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.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false [2022-11-10 10:42:30,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-10 10:42:30,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-10 10:42:30,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-10 10:42:30,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-10 10:42:30,106 INFO L275 PluginConnector]: CDTParser initialized [2022-11-10 10:42:30,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-11-10 10:42:30,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2178dd/31d17094d9d3452bba4766b1de733d62/FLAG6a7c3a9fc [2022-11-10 10:42:30,675 INFO L306 CDTParser]: Found 1 translation units. [2022-11-10 10:42:30,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i [2022-11-10 10:42:30,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2178dd/31d17094d9d3452bba4766b1de733d62/FLAG6a7c3a9fc [2022-11-10 10:42:31,182 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47f2178dd/31d17094d9d3452bba4766b1de733d62 [2022-11-10 10:42:31,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-10 10:42:31,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-10 10:42:31,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-10 10:42:31,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-10 10:42:31,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-10 10:42:31,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d4ad31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31, skipping insertion in model container [2022-11-10 10:42:31,194 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-10 10:42:31,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-10 10:42:31,633 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-11-10 10:42:31,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-11-10 10:42:31,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 10:42:31,654 INFO L203 MainTranslator]: Completed pre-run [2022-11-10 10:42:31,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43280,43293] [2022-11-10 10:42:31,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok_longest.i[43553,43566] [2022-11-10 10:42:31,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-10 10:42:31,745 INFO L208 MainTranslator]: Completed translation [2022-11-10 10:42:31,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31 WrapperNode [2022-11-10 10:42:31,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-10 10:42:31,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-10 10:42:31,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-10 10:42:31,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-10 10:42:31,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,839 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 389 [2022-11-10 10:42:31,840 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-10 10:42:31,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-10 10:42:31,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-10 10:42:31,840 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-10 10:42:31,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,908 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-10 10:42:31,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-10 10:42:31,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-10 10:42:31,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-10 10:42:31,918 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (1/1) ... [2022-11-10 10:42:31,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-10 10:42:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:31,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-10 10:42:32,001 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-11-10 10:42:32,002 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-11-10 10:42:32,002 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-10 10:42:32,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-10 10:42:32,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-10 10:42:32,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-10 10:42:32,004 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-10 10:42:31,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-10 10:42:32,209 INFO L235 CfgBuilder]: Building ICFG [2022-11-10 10:42:32,210 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-10 10:42:32,838 INFO L276 CfgBuilder]: Performing block encoding [2022-11-10 10:42:32,848 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-10 10:42:32,848 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-10 10:42:32,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:32 BoogieIcfgContainer [2022-11-10 10:42:32,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-10 10:42:32,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-10 10:42:32,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-10 10:42:32,856 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-10 10:42:32,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:42:31" (1/3) ... [2022-11-10 10:42:32,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bb0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:42:32, skipping insertion in model container [2022-11-10 10:42:32,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:42:31" (2/3) ... [2022-11-10 10:42:32,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bb0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:42:32, skipping insertion in model container [2022-11-10 10:42:32,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:42:32" (3/3) ... [2022-11-10 10:42:32,858 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2022-11-10 10:42:32,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-10 10:42:32,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-10 10:42:32,873 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 35 error locations. [2022-11-10 10:42:32,873 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-10 10:42:33,049 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-10 10:42:33,111 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SYNTACTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-11-10 10:42:33,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-10 10:42:33,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:33,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-10 10:42:33,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-10 10:42:33,156 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-10 10:42:33,168 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2022-11-10 10:42:33,174 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;@14be30ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-10 10:42:33,175 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-10 10:42:33,576 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:33,581 INFO L85 PathProgramCache]: Analyzing trace with hash 307049292, now seen corresponding path program 1 times [2022-11-10 10:42:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:33,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665118492] [2022-11-10 10:42:33,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:33,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:33,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:33,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:33,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665118492] [2022-11-10 10:42:33,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665118492] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:33,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:33,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 10:42:33,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380770599] [2022-11-10 10:42:33,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:33,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-10 10:42:33,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:33,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-10 10:42:33,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-10 10:42:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,878 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:33,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:33,879 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:33,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-10 10:42:33,928 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:33,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:33,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1033758044, now seen corresponding path program 1 times [2022-11-10 10:42:33,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:33,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331521057] [2022-11-10 10:42:33,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:33,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:33,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:34,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:34,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:34,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331521057] [2022-11-10 10:42:34,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331521057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:34,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:34,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-10 10:42:34,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489415657] [2022-11-10 10:42:34,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:34,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:34,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:34,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 10:42:34,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,089 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:34,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 54.5) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:34,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-10 10:42:34,143 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:34,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:34,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1799055717, now seen corresponding path program 1 times [2022-11-10 10:42:34,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:34,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449796101] [2022-11-10 10:42:34,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:34,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:34,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:34,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449796101] [2022-11-10 10:42:34,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449796101] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:34,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:34,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 10:42:34,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060261940] [2022-11-10 10:42:34,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:34,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:34,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:34,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:34,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 10:42:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,281 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:34,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:34,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:34,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-10 10:42:34,347 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:34,349 INFO L85 PathProgramCache]: Analyzing trace with hash -847858666, now seen corresponding path program 1 times [2022-11-10 10:42:34,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:34,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292015530] [2022-11-10 10:42:34,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:34,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:35,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:35,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292015530] [2022-11-10 10:42:35,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292015530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:35,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:35,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:35,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842655465] [2022-11-10 10:42:35,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:35,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:35,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:35,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:35,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:35,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,063 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:35,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 25.4) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:35,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,063 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-10 10:42:35,267 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:35,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1013043635, now seen corresponding path program 1 times [2022-11-10 10:42:35,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:35,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820509482] [2022-11-10 10:42:35,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:35,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:35,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:35,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820509482] [2022-11-10 10:42:35,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820509482] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:35,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:35,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94406536] [2022-11-10 10:42:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:35,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:35,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:35,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:35,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:35,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,972 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:35,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.8) internal successors, (134), 6 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:35,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:35,972 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:35,973 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-10 10:42:36,081 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err3ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:36,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:36,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1185226040, now seen corresponding path program 1 times [2022-11-10 10:42:36,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:36,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166631921] [2022-11-10 10:42:36,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:36,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:36,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:36,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:36,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166631921] [2022-11-10 10:42:36,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166631921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:36,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:36,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:36,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521563102] [2022-11-10 10:42:36,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:36,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:36,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:36,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:36,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:36,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,574 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:36,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 28.4) internal successors, (142), 6 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:36,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,575 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:36,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:36,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-10 10:42:36,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:36,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:36,730 INFO L85 PathProgramCache]: Analyzing trace with hash 81553469, now seen corresponding path program 1 times [2022-11-10 10:42:36,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:36,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375166304] [2022-11-10 10:42:36,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:36,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:36,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:37,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375166304] [2022-11-10 10:42:37,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375166304] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:37,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:37,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:37,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214380294] [2022-11-10 10:42:37,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:37,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:37,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,200 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:37,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 30.0) internal successors, (150), 6 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:37,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-10 10:42:37,467 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err6ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:37,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:37,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1482711284, now seen corresponding path program 1 times [2022-11-10 10:42:37,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:37,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132701515] [2022-11-10 10:42:37,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:37,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:38,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:38,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:38,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132701515] [2022-11-10 10:42:38,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132701515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:38,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:38,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971001205] [2022-11-10 10:42:38,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:38,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:38,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:38,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:38,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,013 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:38,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 33.6) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:38,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,013 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-10 10:42:38,230 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:38,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:38,231 INFO L85 PathProgramCache]: Analyzing trace with hash -360395587, now seen corresponding path program 1 times [2022-11-10 10:42:38,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:38,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210676886] [2022-11-10 10:42:38,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:38,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:38,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:38,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210676886] [2022-11-10 10:42:38,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210676886] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:38,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:38,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:38,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905176318] [2022-11-10 10:42:38,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:38,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:38,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:38,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:38,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,802 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:38,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 36.2) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:38,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:38,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:38,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:38,803 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-10 10:42:39,015 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err10ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:39,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:39,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1453932820, now seen corresponding path program 1 times [2022-11-10 10:42:39,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:39,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198027488] [2022-11-10 10:42:39,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:39,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:39,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:39,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:39,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198027488] [2022-11-10 10:42:39,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198027488] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:39,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588951035] [2022-11-10 10:42:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:39,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:39,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:39,187 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:39,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-10 10:42:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:39,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 10:42:39,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:39,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-10 10:42:39,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 10:42:39,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588951035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:39,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 10:42:39,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-10 10:42:39,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340440633] [2022-11-10 10:42:39,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:39,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:39,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:39,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:39,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:39,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,476 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:39,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 95.0) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:39,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:39,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:39,740 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,SelfDestructingSolverStorable9 [2022-11-10 10:42:39,740 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1050946421, now seen corresponding path program 1 times [2022-11-10 10:42:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825064358] [2022-11-10 10:42:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:39,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:39,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:39,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825064358] [2022-11-10 10:42:39,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825064358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:39,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192318133] [2022-11-10 10:42:39,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:39,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:39,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:39,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:39,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-10 10:42:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:40,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-10 10:42:40,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:40,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-10 10:42:40,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-10 10:42:40,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192318133] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:40,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-10 10:42:40,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2022-11-10 10:42:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923500455] [2022-11-10 10:42:40,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:40,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:40,227 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:40,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 97.5) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:40,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:40,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,228 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:40,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:40,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:40,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:40,575 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:40,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2123588399, now seen corresponding path program 1 times [2022-11-10 10:42:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:40,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221419173] [2022-11-10 10:42:40,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:40,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221419173] [2022-11-10 10:42:40,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221419173] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:40,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178131483] [2022-11-10 10:42:40,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:40,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:40,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:40,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:40,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-10 10:42:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:41,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-10 10:42:41,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:41,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:42:41,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-10 10:42:41,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178131483] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:42:41,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:42:41,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-10 10:42:41,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459108151] [2022-11-10 10:42:41,214 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:42:41,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-10 10:42:41,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:41,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-10 10:42:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-10 10:42:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:41,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:41,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.4) internal successors, (364), 10 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:41,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:41,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,217 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:41,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:41,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:41,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:41,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:41,596 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err11ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:41,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:41,596 INFO L85 PathProgramCache]: Analyzing trace with hash -2140940803, now seen corresponding path program 2 times [2022-11-10 10:42:41,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:41,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383699710] [2022-11-10 10:42:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:41,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:42,075 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-11-10 10:42:42,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:42,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383699710] [2022-11-10 10:42:42,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383699710] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:42,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:42,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-10 10:42:42,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231790579] [2022-11-10 10:42:42,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:42,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-10 10:42:42,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:42,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-10 10:42:42,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-10 10:42:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:42,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:42,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:42,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:42,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:42,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:42,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-10 10:42:42,175 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:42,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:42,175 INFO L85 PathProgramCache]: Analyzing trace with hash -423553234, now seen corresponding path program 1 times [2022-11-10 10:42:42,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:42,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510325922] [2022-11-10 10:42:42,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:42,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:46,074 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 6 proven. 116 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2022-11-10 10:42:46,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:46,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510325922] [2022-11-10 10:42:46,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510325922] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:42:46,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664392462] [2022-11-10 10:42:46,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:46,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:42:46,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:42:46,076 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:42:46,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-10 10:42:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:46,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-10 10:42:46,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:42:47,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-11-10 10:42:47,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:42:47,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:42:47,556 INFO L356 Elim1Store]: treesize reduction 53, result has 19.7 percent of original size [2022-11-10 10:42:47,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 30 [2022-11-10 10:42:47,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:42:47,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-10 10:42:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 144 proven. 49 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-10 10:42:47,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:42:48,410 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_30| Int) (v_ArrVal_2256 Int) (v_ArrVal_2257 (Array Int Int)) (v_ArrVal_2258 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_2256)) |c_~#stored_elements~0.base| v_ArrVal_2257) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= v_ArrVal_2256 1)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_30| (select .cse0 .cse1))) (not (= 800 (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_30| 4) |c_~#queue~0.offset|) v_ArrVal_2258) .cse1)))))) is different from false [2022-11-10 10:42:48,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:42:48,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 48 [2022-11-10 10:42:48,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:42:48,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2022-11-10 10:42:48,587 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 78 treesize of output 70 [2022-11-10 10:42:48,600 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 8 treesize of output 4 [2022-11-10 10:42:48,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:42:48,638 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 52 treesize of output 48 [2022-11-10 10:42:49,104 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 150 proven. 43 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-10 10:42:49,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664392462] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:42:49,104 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:42:49,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 15] total 47 [2022-11-10 10:42:49,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145326255] [2022-11-10 10:42:49,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:42:49,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-10 10:42:49,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:49,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-10 10:42:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1889, Unknown=8, NotChecked=88, Total=2162 [2022-11-10 10:42:49,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:49,108 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:49,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 16.404255319148938) internal successors, (771), 47 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:49,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:49,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:49,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:52,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:52,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-10 10:42:52,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-10 10:42:52,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-10 10:42:52,417 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:52,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:52,418 INFO L85 PathProgramCache]: Analyzing trace with hash 148529074, now seen corresponding path program 1 times [2022-11-10 10:42:52,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:52,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991541489] [2022-11-10 10:42:52,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:52,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:42:53,176 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-11-10 10:42:53,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:42:53,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991541489] [2022-11-10 10:42:53,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991541489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:42:53,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:42:53,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-10 10:42:53,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342922546] [2022-11-10 10:42:53,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:42:53,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-10 10:42:53,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:42:53,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-10 10:42:53,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-11-10 10:42:53,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:53,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:42:53,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 40.2) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:53,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-11-10 10:42:53,181 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:54,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-10 10:42:54,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:42:54,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-10 10:42:54,982 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err8ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:42:54,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:42:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1770100021, now seen corresponding path program 1 times [2022-11-10 10:42:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:42:54,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046266832] [2022-11-10 10:42:54,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:42:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:42:55,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:03,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 54 proven. 823 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2022-11-10 10:43:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:43:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046266832] [2022-11-10 10:43:03,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046266832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:43:03,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145032876] [2022-11-10 10:43:03,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:03,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:43:03,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:43:03,164 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:43:03,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-10 10:43:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:03,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-10 10:43:03,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:43:04,772 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 13 treesize of output 9 [2022-11-10 10:43:04,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:04,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:43:05,194 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:05,202 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:43:05,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-10 10:43:05,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:05,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:05,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:43:05,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:05,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:43:06,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:06,238 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:43:06,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-10 10:43:06,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:06,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:06,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 1456 proven. 65 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2022-11-10 10:43:06,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:43:07,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1))))) is different from false [2022-11-10 10:43:07,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1))))) is different from false [2022-11-10 10:43:07,097 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 800))) is different from false [2022-11-10 10:43:07,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 800))) is different from false [2022-11-10 10:43:07,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3925 Int) (v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3925)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1))))) is different from false [2022-11-10 10:43:07,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3925 Int) (v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3925)))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_3933)) .cse1)) 800))) is different from false [2022-11-10 10:43:07,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3925 Int) (v_ArrVal_3933 Int) (v_ArrVal_3931 (Array Int Int)) (v_ArrVal_3928 Int)) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* (select .cse4 .cse3) 4)) v_ArrVal_3925)))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_3928) .cse3 (+ (select .cse2 .cse3) 1))))) |c_~#stored_elements~0.base| v_ArrVal_3931) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_3933)) .cse1))))) is different from false [2022-11-10 10:43:07,808 INFO L356 Elim1Store]: treesize reduction 335, result has 45.1 percent of original size [2022-11-10 10:43:07,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 457 treesize of output 530 [2022-11-10 10:43:07,892 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-11-10 10:43:07,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 426 treesize of output 651 [2022-11-10 10:43:08,235 INFO L356 Elim1Store]: treesize reduction 104, result has 39.2 percent of original size [2022-11-10 10:43:08,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 8 new quantified variables, introduced 25 case distinctions, treesize of input 668 treesize of output 2118 [2022-11-10 10:43:08,318 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 229 treesize of output 193 [2022-11-10 10:43:08,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 33 treesize of output 21 [2022-11-10 10:43:08,752 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 8 treesize of output 4 [2022-11-10 10:43:08,858 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 8 treesize of output 4 [2022-11-10 10:43:09,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:09,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 90 [2022-11-10 10:43:09,597 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:09,598 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 91 treesize of output 87 [2022-11-10 10:43:10,205 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:10,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 940 treesize of output 892 [2022-11-10 10:43:14,296 INFO L356 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2022-11-10 10:43:14,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 4571 treesize of output 4275 [2022-11-10 10:43:14,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 45 treesize of output 37 [2022-11-10 10:43:14,467 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 8 treesize of output 4 [2022-11-10 10:43:14,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-10 10:43:14,494 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 10:43:14,494 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 43 treesize of output 30 [2022-11-10 10:43:14,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2022-11-10 10:43:14,511 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 62 treesize of output 54 [2022-11-10 10:43:14,525 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 34 treesize of output 22 [2022-11-10 10:43:14,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2022-11-10 10:43:14,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:14,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 43 treesize of output 27 [2022-11-10 10:43:14,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 18 [2022-11-10 10:43:14,588 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 8 treesize of output 4 [2022-11-10 10:43:14,941 INFO L134 CoverageAnalysis]: Checked inductivity of 3039 backedges. 1364 proven. 65 refuted. 6 times theorem prover too weak. 1518 trivial. 86 not checked. [2022-11-10 10:43:14,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145032876] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:43:14,942 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:43:14,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17, 21] total 58 [2022-11-10 10:43:14,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148171289] [2022-11-10 10:43:14,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:43:14,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-10 10:43:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:43:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-10 10:43:14,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2244, Unknown=14, NotChecked=728, Total=3306 [2022-11-10 10:43:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:14,948 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:43:14,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 17.93103448275862) internal successors, (1040), 58 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,948 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-10 10:43:21,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-10 10:43:21,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-10 10:43:21,560 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:43:21,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:43:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash -2059792118, now seen corresponding path program 1 times [2022-11-10 10:43:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:43:21,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702019716] [2022-11-10 10:43:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:21,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:43:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 78 proven. 985 refuted. 0 times theorem prover too weak. 5027 trivial. 0 not checked. [2022-11-10 10:43:31,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:43:31,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702019716] [2022-11-10 10:43:31,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702019716] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:43:31,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775644114] [2022-11-10 10:43:31,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:31,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:43:31,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:43:31,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:43:31,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-10 10:43:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:43:32,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 3827 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-10 10:43:32,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:43:36,618 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 13 treesize of output 9 [2022-11-10 10:43:36,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:36,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:43:37,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:43:37,086 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:43:37,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:43:37,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:37,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:38,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-11-10 10:43:38,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:43:38,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:43:38,494 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:43:38,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 27 [2022-11-10 10:43:38,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:43:38,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2022-11-10 10:43:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 2104 proven. 704 refuted. 0 times theorem prover too weak. 3282 trivial. 0 not checked. [2022-11-10 10:43:38,649 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:43:38,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5934 Int) (v_ArrVal_5932 (Array Int Int))) (not (= 800 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_5932) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5934)) .cse1))))) is different from false [2022-11-10 10:43:38,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5934 Int) (v_ArrVal_5932 (Array Int Int))) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_5932) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5934)) .cse1)) 800))) is different from false [2022-11-10 10:43:39,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5934 Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5929 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5929) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5932) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5934)) .cse1)) 800))) is different from false [2022-11-10 10:43:39,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5926 Int) (v_ArrVal_5934 Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5929 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5926)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5929) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5932) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5934)) .cse1)) 800))) is different from false [2022-11-10 10:43:39,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_74| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_5926 Int) (v_ArrVal_5934 Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5929 Int)) (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_74| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5926))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_5929) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5932) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_5934)) .cse1)) 800))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_74| (select .cse4 .cse3)))))) is different from false [2022-11-10 10:43:39,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_74| Int) (v_ArrVal_5926 Int) (v_ArrVal_5934 Int) (v_ArrVal_5932 (Array Int Int)) (v_ArrVal_5929 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (or (not (= (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (let ((.cse2 (store .cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_74| 4)) v_ArrVal_5926))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_5929) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_5932) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_5934)) .cse1)) 800)) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_74| (select .cse4 .cse3)))))) is different from false [2022-11-10 10:43:39,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:39,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 205 treesize of output 145 [2022-11-10 10:43:39,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:39,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 227 treesize of output 225 [2022-11-10 10:43:40,003 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 242 treesize of output 226 [2022-11-10 10:43:40,012 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 233 treesize of output 209 [2022-11-10 10:43:40,033 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 8 treesize of output 4 [2022-11-10 10:43:40,046 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:43:40,047 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 116 treesize of output 104 [2022-11-10 10:43:41,204 INFO L134 CoverageAnalysis]: Checked inductivity of 6090 backedges. 1644 proven. 687 refuted. 0 times theorem prover too weak. 3309 trivial. 450 not checked. [2022-11-10 10:43:41,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775644114] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:43:41,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:43:41,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 22] total 61 [2022-11-10 10:43:41,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530756481] [2022-11-10 10:43:41,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:43:41,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-11-10 10:43:41,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:43:41,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-11-10 10:43:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=2665, Unknown=29, NotChecked=666, Total=3660 [2022-11-10 10:43:41,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:41,209 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:43:41,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 19.295081967213115) internal successors, (1177), 61 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-10 10:43:41,210 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-11-10 10:43:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-11-10 10:43:51,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-10 10:43:51,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:43:51,316 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:43:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:43:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2134235087, now seen corresponding path program 1 times [2022-11-10 10:43:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:43:51,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793102839] [2022-11-10 10:43:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:43:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:43:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:44:07,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13280 backedges. 905 proven. 0 refuted. 0 times theorem prover too weak. 12375 trivial. 0 not checked. [2022-11-10 10:44:07,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:44:07,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793102839] [2022-11-10 10:44:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793102839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-10 10:44:07,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-10 10:44:07,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-10 10:44:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645485649] [2022-11-10 10:44:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-10 10:44:07,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-10 10:44:07,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:44:07,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-10 10:44:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-11-10 10:44:07,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:07,994 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:44:07,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 14.833333333333334) internal successors, (267), 18 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:07,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-10 10:44:07,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:07,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 61 states. [2022-11-10 10:44:07,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 81 states. [2022-11-10 10:44:07,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:15,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:44:15,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:44:15,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-10 10:44:15,664 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:44:15,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:44:15,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1272557443, now seen corresponding path program 1 times [2022-11-10 10:44:15,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:44:15,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369598750] [2022-11-10 10:44:15,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:44:15,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:44:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:44:23,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2071 backedges. 18 proven. 849 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2022-11-10 10:44:23,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:44:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369598750] [2022-11-10 10:44:23,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369598750] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:44:23,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851419797] [2022-11-10 10:44:23,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:44:23,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:44:23,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:44:23,670 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:44:23,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-10 10:44:24,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:44:24,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 2445 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-10 10:44:24,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:44:24,688 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:44:24,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:44:24,949 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 13 treesize of output 9 [2022-11-10 10:44:25,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:44:25,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:44:25,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:44:25,739 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:44:25,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:44:25,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:44:25,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:44:26,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-10 10:44:26,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:44:26,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:44:26,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:44:26,589 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-11-10 10:44:26,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:44:26,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:44:26,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:44:26,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-10 10:44:26,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2071 backedges. 786 proven. 49 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-11-10 10:44:26,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:45:06,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:06,700 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 135 treesize of output 95 [2022-11-10 10:45:06,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:06,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 131 treesize of output 133 [2022-11-10 10:45:06,714 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 59 treesize of output 51 [2022-11-10 10:45:06,719 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 50 treesize of output 42 [2022-11-10 10:45:06,730 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 8 treesize of output 4 [2022-11-10 10:45:06,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:06,772 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 74 treesize of output 70 [2022-11-10 10:45:11,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:11,080 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-11-10 10:45:11,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2071 backedges. 786 proven. 49 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2022-11-10 10:45:11,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851419797] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:45:11,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:45:11,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 23, 24] total 72 [2022-11-10 10:45:11,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966375147] [2022-11-10 10:45:11,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:45:11,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-10 10:45:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:45:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-10 10:45:11,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=4601, Unknown=77, NotChecked=0, Total=5112 [2022-11-10 10:45:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:11,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:45:11,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 12.63888888888889) internal successors, (910), 72 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:11,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:45:11,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:45:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:45:36,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:45:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:45:36,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-10 10:45:36,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:45:36,452 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:45:36,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:45:36,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1338712381, now seen corresponding path program 2 times [2022-11-10 10:45:36,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:45:36,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019195640] [2022-11-10 10:45:36,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:45:36,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:45:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:45:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 18 proven. 2180 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2022-11-10 10:45:52,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:45:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019195640] [2022-11-10 10:45:52,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019195640] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:45:52,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852364375] [2022-11-10 10:45:52,857 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 10:45:52,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:45:52,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:45:52,859 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:45:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-10 10:45:53,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 10:45:53,505 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 10:45:53,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-10 10:45:53,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:45:53,584 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:45:53,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:45:55,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-10 10:45:55,852 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-10 10:45:55,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:55,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-10 10:45:55,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:55,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 57 [2022-11-10 10:45:56,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2022-11-10 10:45:56,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 27 proven. 9 refuted. 0 times theorem prover too weak. 3366 trivial. 0 not checked. [2022-11-10 10:45:56,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:45:56,321 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse2 (+ 3 |c_~#stored_elements~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#stored_elements~0.base| (store (select |c_#race| |c_~#stored_elements~0.base|) .cse2 |c_t1Thread1of1ForFork1_#t~nondet63#1|)))) (and (forall ((v_ArrVal_10151 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse1)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_10151 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) .cse2) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_10151 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse1)))) (forall ((v_ArrVal_10151 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) (+ 2 |c_~#stored_elements~0.offset| .cse1)))))))) is different from false [2022-11-10 10:45:56,334 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse2 (+ 2 |c_~#stored_elements~0.offset| .cse1)) (.cse3 (+ 3 |c_~#stored_elements~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#stored_elements~0.base| (store (store (select |c_#race| |c_~#stored_elements~0.base|) .cse2 |c_t1Thread1of1ForFork1_#t~nondet63#1|) .cse3 |c_t1Thread1of1ForFork1_#t~nondet63#1|)))) (and (forall ((v_ArrVal_10151 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse1)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_10151 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) .cse2))) (forall ((v_ArrVal_10151 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse1)))) (forall ((v_ArrVal_10151 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_10151) |c_~#stored_elements~0.base|) .cse3))))))) is different from false [2022-11-10 10:45:56,485 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:56,485 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 4 case distinctions, treesize of input 51 treesize of output 67 [2022-11-10 10:45:56,490 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:45:56,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 31 [2022-11-10 10:45:56,497 INFO L356 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-10 10:45:56,497 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2022-11-10 10:45:56,502 INFO L356 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2022-11-10 10:45:56,502 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2022-11-10 10:45:57,489 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 10:45:57,489 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 13 treesize of output 12 [2022-11-10 10:45:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3402 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 3366 trivial. 18 not checked. [2022-11-10 10:45:57,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852364375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:45:57,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:45:57,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 9, 9] total 55 [2022-11-10 10:45:57,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587203691] [2022-11-10 10:45:57,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:45:57,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-10 10:45:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:45:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-10 10:45:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2496, Unknown=70, NotChecked=210, Total=3080 [2022-11-10 10:45:57,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:57,497 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:45:57,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 16.854545454545455) internal successors, (927), 56 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:45:57,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:45:57,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:57,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:57,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,497 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:45:57,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:46:00,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:46:00,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-10 10:46:00,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:46:00,541 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:46:00,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:46:00,541 INFO L85 PathProgramCache]: Analyzing trace with hash 917885578, now seen corresponding path program 1 times [2022-11-10 10:46:00,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:46:00,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983224399] [2022-11-10 10:46:00,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:46:00,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:46:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:46:37,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17469 backedges. 0 proven. 6793 refuted. 0 times theorem prover too weak. 10676 trivial. 0 not checked. [2022-11-10 10:46:37,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:46:37,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983224399] [2022-11-10 10:46:37,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983224399] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:46:37,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689801630] [2022-11-10 10:46:37,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:46:37,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:46:37,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:46:37,470 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:46:37,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-10 10:46:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:46:39,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 6136 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-10 10:46:39,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:46:39,466 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:46:39,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:46:39,785 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 13 treesize of output 9 [2022-11-10 10:46:39,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:46:40,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:46:40,955 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:46:40,963 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:46:40,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:46:41,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:41,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:46:41,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-10 10:46:41,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:41,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:46:42,000 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:46:42,014 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:46:42,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:46:42,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:42,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:46:42,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-10 10:46:42,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:42,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:46:43,116 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:46:43,125 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:46:43,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:46:43,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:43,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:46:43,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2022-11-10 10:46:44,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:44,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-10 10:46:44,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-10 10:46:44,457 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-11-10 10:46:44,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 27 [2022-11-10 10:46:44,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-10 10:46:44,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-10 10:46:44,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 7 [2022-11-10 10:46:45,048 INFO L134 CoverageAnalysis]: Checked inductivity of 17469 backedges. 5184 proven. 396 refuted. 0 times theorem prover too weak. 11889 trivial. 0 not checked. [2022-11-10 10:46:45,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:46:45,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13401 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| 3204)) 800)) is different from false [2022-11-10 10:47:26,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13393 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (not (<= v_ArrVal_13393 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_13400)))))) is different from false [2022-11-10 10:48:14,168 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13393 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse4 (store .cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|)) v_ArrVal_13389)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13391) .cse5 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_13400) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse6 .cse5)))))))))) is different from false [2022-11-10 10:48:26,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13387 (Array Int Int)) (v_ArrVal_13393 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse7 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse4 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse6 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (store (store .cse7 |c_~#queue~0.base| (store (store .cse3 .cse6 v_ArrVal_13391) .cse1 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse2 (select .cse5 |c_~#queue~0.base|))) (let ((.cse0 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_13400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse2 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse4 .cse1))) (< (select (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 .cse6 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800))))))))) is different from false [2022-11-10 10:48:27,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_13391) .cse3 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= v_ArrVal_13385 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse1 .cse3) 1) v_ArrVal_13400) (< (+ (select .cse4 .cse3) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse6 .cse3))))))))))) is different from false [2022-11-10 10:48:27,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse7 |c_~#queue~0.base| (store (store .cse4 .cse2 v_ArrVal_13391) .cse3 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse5 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1) v_ArrVal_13385) (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse1 .cse3) 1) v_ArrVal_13400) (< (+ (select .cse4 .cse3) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse5 .cse3))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse6 .cse3))))))))))) is different from false [2022-11-10 10:48:38,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13384 Int) (v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13384) .cse1 v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse2 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse8 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse7 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse8 v_ArrVal_13391) .cse3 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse6 (select .cse7 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_13385) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse2 .cse3))) (< (+ (select .cse4 .cse3) 1) v_ArrVal_13393) (< (+ (select .cse5 .cse3) 1) v_ArrVal_13400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse6 .cse3))) (< (select (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse8 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800)))))))))) is different from false [2022-11-10 10:48:38,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13384 Int) (v_ArrVal_13381 Int) (v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13381)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13384) .cse1 v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse4 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse4 .cse7 v_ArrVal_13391) .cse3 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse5 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_13385) (< (+ (select .cse2 .cse3) 1) v_ArrVal_13400) (< (+ (select .cse4 .cse3) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse5 .cse3))) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse8 .cse3)))))))))))) is different from false [2022-11-10 10:48:39,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230| Int)) (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_13384 Int) (v_ArrVal_13381 Int) (v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse7 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13381))) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13384) .cse8 v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse0 (select .cse9 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (store (store .cse9 |c_~#queue~0.base| (store (store .cse5 .cse4 v_ArrVal_13391) .cse1 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse5 .cse1) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse6 .cse1))) (< (+ (select .cse3 .cse1) 1) v_ArrVal_13400) (< (+ (select .cse7 .cse8) 1) v_ArrVal_13385)))))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230| (select .cse10 .cse8)))))) is different from false [2022-11-10 10:48:39,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13384 Int) (v_ArrVal_13381 Int) (v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse6 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230|)) v_ArrVal_13381)) (.cse7 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse10 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13384) .cse7 v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389)) (.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse2 v_ArrVal_13391) .cse3 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse9 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse1 .cse3) 1) v_ArrVal_13400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse4 .cse3))) (< (+ (select .cse5 .cse3) 1) v_ArrVal_13393) (< (+ (select .cse6 .cse7) 1) v_ArrVal_13385) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230| (select .cse8 .cse7))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse9 .cse3))))))))))))) is different from false [2022-11-10 10:48:59,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_13384 Int) (v_ArrVal_13381 Int) (v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13378 Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13385 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int) (v_ArrVal_13387 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13380 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230| Int) (v_ArrVal_13394 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) v_ArrVal_13378)) |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_13380))) (let ((.cse0 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230|)) v_ArrVal_13381)) (.cse7 (+ 3208 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse9 (store (store .cse10 |c_~#queue~0.base| (store (store .cse5 .cse7 v_ArrVal_13384) .cse1 v_ArrVal_13385)) |c_~#stored_elements~0.base| v_ArrVal_13387))) (let ((.cse4 (select .cse9 |c_~#queue~0.base|))) (let ((.cse8 (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389))) (let ((.cse6 (store (store .cse9 |c_~#queue~0.base| (store (store .cse8 .cse7 v_ArrVal_13391) .cse1 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse3 (select .cse6 |c_~#queue~0.base|))) (let ((.cse2 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_230| (select .cse0 .cse1))) (< (+ (select .cse2 .cse1) 1) v_ArrVal_13400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse3 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse4 .cse1))) (< (+ (select .cse5 .cse1) 1) v_ArrVal_13385) (< (select (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse7 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse8 .cse1) 1) v_ArrVal_13393)))))))))))) is different from false [2022-11-10 10:48:59,992 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:48:59,993 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 865 treesize of output 555 [2022-11-10 10:49:00,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:49:00,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 913 treesize of output 911 [2022-11-10 10:49:00,040 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 236 treesize of output 228 [2022-11-10 10:49:00,057 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 440 treesize of output 408 [2022-11-10 10:49:00,073 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 484 treesize of output 468 [2022-11-10 10:49:00,088 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 230 treesize of output 198 [2022-11-10 10:49:00,119 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 8 treesize of output 4 [2022-11-10 10:49:00,257 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:49:00,257 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 324 treesize of output 320 [2022-11-10 10:49:01,015 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:49:01,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 43 [2022-11-10 10:49:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 17469 backedges. 5184 proven. 231 refuted. 18 times theorem prover too weak. 11889 trivial. 147 not checked. [2022-11-10 10:49:01,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689801630] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:49:01,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:49:01,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 35, 42] total 115 [2022-11-10 10:49:01,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049195998] [2022-11-10 10:49:01,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:49:01,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-11-10 10:49:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:49:01,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-11-10 10:49:01,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=9480, Unknown=193, NotChecked=2354, Total=13110 [2022-11-10 10:49:01,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:49:01,171 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:49:01,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 12.895652173913044) internal successors, (1483), 115 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:49:01,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:49:01,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:01,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:01,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,172 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:49:01,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:49:30,312 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 355 DAG size of output: 159 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-10 10:50:00,224 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse13 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse12 (select .cse14 .cse11))) (and (forall ((v_ArrVal_13393 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse5 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse0 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_~#queue~0.offset|) v_ArrVal_13389))) (let ((.cse2 (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse4 v_ArrVal_13391) .cse1 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse6 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_13393) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (< (+ (select .cse3 .cse1) 1) v_ArrVal_13400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| (select .cse5 .cse1))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse6 .cse1)))))))))) (forall ((v_ArrVal_13393 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse10 (store .cse14 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|)) v_ArrVal_13389))) (let ((.cse8 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse10 .cse13 v_ArrVal_13391) .cse11 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse9 (select .cse8 |c_~#queue~0.base|))) (let ((.cse7 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse7 .cse1) 1) v_ArrVal_13400) (< (select (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse9 .cse1))) (< (+ (select .cse10 .cse11) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| .cse12)))))))) (forall ((v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse15 (store .cse14 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|)) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| .cse12)) (< (+ (select .cse15 .cse11) 1) v_ArrVal_13400) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse15 .cse13 v_ArrVal_13397) .cse11 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800)))) (< .cse12 800)))) is different from false [2022-11-10 10:50:00,232 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204))) (let ((.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse6 (select .cse8 .cse5))) (and (forall ((v_ArrVal_13393 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse4 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|)) v_ArrVal_13389))) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse4 .cse7 v_ArrVal_13391) .cse5 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse3 (select .cse2 |c_~#queue~0.base|))) (let ((.cse0 (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_13400) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse3 .cse1))) (< (+ (select .cse4 .cse5) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| .cse6)))))))) (forall ((v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse9 (store .cse8 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|)) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| .cse6)) (< (+ (select .cse9 .cse5) 1) v_ArrVal_13400) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse9 .cse7 v_ArrVal_13397) .cse5 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800)))) (< .cse6 800)))) is different from false [2022-11-10 10:50:12,786 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse10 (select .cse8 .cse5)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse9 (+ (* |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (and (forall ((v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse4 (store .cse8 .cse9 v_ArrVal_13389))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse4 .cse7 v_ArrVal_13391) .cse5 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse6 (select .cse0 |c_~#queue~0.base|))) (let ((.cse1 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store (store .cse1 .cse2 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse4 .cse5) 1) v_ArrVal_13393) (< (+ (select .cse1 .cse3) 1) v_ArrVal_13400) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse6 .cse3))))))))) (forall ((v_ArrVal_13401 (Array Int Int)) (v_ArrVal_13400 Int)) (or (< (+ .cse10 1) v_ArrVal_13400) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse8 .cse5 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| Int)) (or (forall ((v_ArrVal_13393 Int) (v_ArrVal_13391 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13389 Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse11 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13389))) (let ((.cse14 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse11 .cse7 v_ArrVal_13391) .cse5 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse12 (select .cse14 |c_~#queue~0.base|))) (let ((.cse13 (store .cse12 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (+ (select .cse11 .cse5) 1) v_ArrVal_13393) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse12 .cse3))) (< (+ (select .cse13 .cse3) 1) v_ArrVal_13400) (< (select (select (store (store .cse14 |c_~#queue~0.base| (store (store .cse13 .cse2 v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800))))))) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_227| .cse10)))) (forall ((v_ArrVal_13402 Int)) (< (select (store .cse8 .cse9 v_ArrVal_13402) .cse5) 800)) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| .cse10)) (forall ((v_ArrVal_13401 (Array Int Int)) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse15 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13396))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse15 .cse7 v_ArrVal_13397) .cse5 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800) (< (+ (select .cse15 .cse5) 1) v_ArrVal_13400)))))) (forall ((v_ArrVal_13401 (Array Int Int)) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse16 (store .cse8 .cse9 v_ArrVal_13396))) (or (< (+ (select .cse16 .cse5) 1) v_ArrVal_13400) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse16 .cse7 v_ArrVal_13397) .cse5 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse3) 800))))))) is different from false [2022-11-10 10:51:04,304 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse11 (select .cse6 .cse7))) (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse5 (+ .cse11 1)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_13393 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (< .cse5 v_ArrVal_13393) (< (+ (select .cse3 .cse1) 1) v_ArrVal_13400)))))) (forall ((v_ArrVal_13393 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse8 .cse1))) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1) v_ArrVal_13393) (< (+ (select .cse10 .cse1) 1) v_ArrVal_13400)))))) (forall ((v_ArrVal_13401 (Array Int Int)) (v_ArrVal_13400 Int)) (or (< .cse5 v_ArrVal_13400) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800))) (< .cse11 800))))) is different from false [2022-11-10 10:51:04,314 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#t~post47#1| 1))) (and (forall ((v_ArrVal_13393 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse2 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse0 (select .cse2 |c_~#queue~0.base|))) (let ((.cse3 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse0 .cse1))) (< (select (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (not (<= v_ArrVal_13393 .cse5)) (< (+ (select .cse3 .cse1) 1) v_ArrVal_13400)))))) (forall ((v_ArrVal_13393 Int) (v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13394 (Array Int Int)) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse9 (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_13393)) |c_~#stored_elements~0.base| v_ArrVal_13394))) (let ((.cse8 (select .cse9 |c_~#queue~0.base|))) (let ((.cse10 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse8 .cse1))) (< (select (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse10 .cse4 v_ArrVal_13397) .cse1 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem46#1| 1) v_ArrVal_13393) (< (+ (select .cse10 .cse1) 1) v_ArrVal_13400)))))) (forall ((v_ArrVal_13401 (Array Int Int)) (v_ArrVal_13400 Int)) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse6 .cse7 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse1) 800) (not (<= v_ArrVal_13400 .cse5)))))) is different from false [2022-11-10 10:51:48,214 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 3204)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse7 (+ 3204 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse8 .cse7)) (.cse4 (+ |c_~#queue~0.offset| 3204)) (.cse1 (select .cse5 .cse3))) (and (< .cse0 800) (forall ((v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse2 (store .cse5 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|)) v_ArrVal_13396))) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| .cse1)) (< (+ (select .cse2 .cse3) 1) v_ArrVal_13400) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_13397) .cse3 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse4) 800)))) (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int)) (or (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| .cse0)) (forall ((v_ArrVal_13401 (Array Int Int)) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse6 (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13396))) (or (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse6 (+ 3208 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_13397) .cse7 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse4) 800) (< (+ (select .cse6 .cse7) 1) v_ArrVal_13400)))))) (forall ((v_ArrVal_13401 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| Int) (v_ArrVal_13400 Int) (v_ArrVal_13396 Int) (v_ArrVal_13397 Int)) (let ((.cse10 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse9 (store .cse10 (+ (* 4 |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224|) |c_~#queue~0.offset|) v_ArrVal_13396))) (or (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse9 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_13397) .cse4 v_ArrVal_13400)) |c_~#stored_elements~0.base| v_ArrVal_13401) |c_~#queue~0.base|) .cse4) 800) (not (<= |v_t1Thread1of1ForFork1_enqueue_#t~mem39#1_224| (select .cse10 .cse4))) (< (+ (select .cse9 .cse4) 1) v_ArrVal_13400))))) (< .cse1 800)))) is different from false [2022-11-10 10:52:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:52:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:52:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:52:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:52:57,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-11-10 10:52:57,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-10 10:52:57,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-10 10:52:57,667 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:52:57,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:52:57,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1159847670, now seen corresponding path program 2 times [2022-11-10 10:52:57,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:52:57,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468057230] [2022-11-10 10:52:57,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:52:57,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:52:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-10 10:54:29,492 INFO L134 CoverageAnalysis]: Checked inductivity of 24895 backedges. 0 proven. 14219 refuted. 0 times theorem prover too weak. 10676 trivial. 0 not checked. [2022-11-10 10:54:29,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-10 10:54:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468057230] [2022-11-10 10:54:29,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468057230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-10 10:54:29,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037370169] [2022-11-10 10:54:29,493 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-10 10:54:29,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-10 10:54:29,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-10 10:54:29,495 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-10 10:54:29,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-10 10:54:30,558 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-10 10:54:30,558 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-10 10:54:30,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-10 10:54:30,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-10 10:54:30,670 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-10 10:54:30,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-10 10:54:41,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-10 10:54:41,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2022-11-10 10:54:41,122 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:54:41,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2022-11-10 10:54:41,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-10 10:54:41,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:54:41,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 52 treesize of output 57 [2022-11-10 10:54:41,280 INFO L134 CoverageAnalysis]: Checked inductivity of 24895 backedges. 50 proven. 50 refuted. 0 times theorem prover too weak. 24795 trivial. 0 not checked. [2022-11-10 10:54:41,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-10 10:54:41,304 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (and (forall ((v_ArrVal_17212 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse0)))) (forall ((v_ArrVal_17212 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse0)))) (forall ((v_ArrVal_17212 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) (+ 2 |c_~#stored_elements~0.offset| .cse0)))))) is different from false [2022-11-10 10:54:41,316 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse2 (+ 2 |c_~#stored_elements~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#stored_elements~0.base| (store (select |c_#race| |c_~#stored_elements~0.base|) .cse2 |c_t1Thread1of1ForFork1_#t~nondet63#1|)))) (and (forall ((v_ArrVal_17212 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| 1 .cse1)))) (forall ((v_ArrVal_17212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse1)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) .cse2) |c_t1Thread1of1ForFork1_#t~nondet63#1|)))))) is different from false [2022-11-10 10:54:41,330 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t1Thread1of1ForFork1_~i~0#1| 4))) (let ((.cse3 (+ |c_~#stored_elements~0.offset| 1 .cse1)) (.cse2 (+ 2 |c_~#stored_elements~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#stored_elements~0.base| (store (store (select |c_#race| |c_~#stored_elements~0.base|) .cse3 |c_t1Thread1of1ForFork1_#t~nondet63#1|) .cse2 |c_t1Thread1of1ForFork1_#t~nondet63#1|)))) (and (forall ((v_ArrVal_17212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) (+ |c_~#stored_elements~0.offset| .cse1)) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17212 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) .cse2) |c_t1Thread1of1ForFork1_#t~nondet63#1|)) (forall ((v_ArrVal_17212 (Array Int Int))) (= |c_t1Thread1of1ForFork1_#t~nondet63#1| (select (select (store .cse0 |c_ULTIMATE.start_main_~#id1~0#1.base| v_ArrVal_17212) |c_~#stored_elements~0.base|) .cse3))))))) is different from false [2022-11-10 10:54:41,343 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:54:41,343 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 3 case distinctions, treesize of input 42 treesize of output 53 [2022-11-10 10:54:41,348 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-10 10:54:41,348 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 91 treesize of output 30 [2022-11-10 10:54:41,354 INFO L356 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-10 10:54:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1 [2022-11-10 10:54:41,360 INFO L356 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-11-10 10:54:41,360 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1 [2022-11-10 10:54:45,472 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-10 10:54:45,472 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 13 treesize of output 12 [2022-11-10 10:54:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 24895 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 24795 trivial. 50 not checked. [2022-11-10 10:54:45,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037370169] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-10 10:54:45,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-10 10:54:45,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 9, 9] total 77 [2022-11-10 10:54:45,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386017308] [2022-11-10 10:54:45,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-10 10:54:45,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-10 10:54:45,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-10 10:54:45,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-10 10:54:45,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=605, Invalid=4954, Unknown=3, NotChecked=444, Total=6006 [2022-11-10 10:54:45,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:54:45,483 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-10 10:54:45,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 16.467532467532468) internal successors, (1268), 78 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 101 states. [2022-11-10 10:54:45,484 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-10 10:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-10 10:54:48,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-11-10 10:54:48,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-10 10:54:48,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-10 10:54:48,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-10 10:54:48,405 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err9ASSERT_VIOLATIONDATA_RACE === [t1Err0ASSERT_VIOLATIONDATA_RACE, t1Err10ASSERT_VIOLATIONDATA_RACE, t1Err11ASSERT_VIOLATIONDATA_RACE, t1Err1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2022-11-10 10:54:48,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-10 10:54:48,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1164546960, now seen corresponding path program 3 times [2022-11-10 10:54:48,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-10 10:54:48,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833764661] [2022-11-10 10:54:48,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-10 10:54:48,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-10 10:54:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2022-11-10 10:55:57,937 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 10:55:57,938 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-10 10:55:58,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-10 10:55:58,002 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Timeout exceeded at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:154) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:260) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:237) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:848) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:776) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:336) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-10 10:55:58,006 INFO L158 Benchmark]: Toolchain (without parser) took 806818.25ms. Allocated memory was 268.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 239.7MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.9GB. Max. memory is 8.0GB. [2022-11-10 10:55:58,006 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-10 10:55:58,006 INFO L158 Benchmark]: CACSL2BoogieTranslator took 558.20ms. Allocated memory is still 268.4MB. Free memory was 239.2MB in the beginning and 216.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-11-10 10:55:58,006 INFO L158 Benchmark]: Boogie Procedure Inliner took 93.26ms. Allocated memory is still 268.4MB. Free memory was 216.2MB in the beginning and 211.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-11-10 10:55:58,006 INFO L158 Benchmark]: Boogie Preprocessor took 74.74ms. Allocated memory is still 268.4MB. Free memory was 211.5MB in the beginning and 206.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-11-10 10:55:58,007 INFO L158 Benchmark]: RCFGBuilder took 934.98ms. Allocated memory is still 268.4MB. Free memory was 206.8MB in the beginning and 166.4MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. [2022-11-10 10:55:58,007 INFO L158 Benchmark]: TraceAbstraction took 805151.70ms. Allocated memory was 268.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 165.9MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-11-10 10:55:58,009 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 184.5MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 558.20ms. Allocated memory is still 268.4MB. Free memory was 239.2MB in the beginning and 216.2MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 93.26ms. Allocated memory is still 268.4MB. Free memory was 216.2MB in the beginning and 211.5MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 74.74ms. Allocated memory is still 268.4MB. Free memory was 211.5MB in the beginning and 206.8MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 934.98ms. Allocated memory is still 268.4MB. Free memory was 206.8MB in the beginning and 166.4MB in the end (delta: 40.4MB). Peak memory consumption was 39.8MB. Max. memory is 8.0GB. * TraceAbstraction took 805151.70ms. Allocated memory was 268.4MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 165.9MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Timeout exceeded de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Timeout exceeded: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:304) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown