/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.error.function.in.sv-comp.mode false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 13:09:19,814 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 13:09:19,815 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 13:09:19,858 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 13:09:19,858 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 13:09:19,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 13:09:19,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 13:09:19,870 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 13:09:19,872 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 13:09:19,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 13:09:19,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 13:09:19,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 13:09:19,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 13:09:19,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 13:09:19,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 13:09:19,883 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 13:09:19,884 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 13:09:19,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 13:09:19,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 13:09:19,897 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 13:09:19,898 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 13:09:19,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 13:09:19,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 13:09:19,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 13:09:19,902 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 13:09:19,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 13:09:19,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 13:09:19,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 13:09:19,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 13:09:19,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 13:09:19,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 13:09:19,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 13:09:19,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 13:09:19,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 13:09:19,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 13:09:19,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 13:09:19,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 13:09:19,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 13:09:19,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 13:09:19,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 13:09:19,909 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 13:09:19,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-09-16 13:09:19,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 13:09:19,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 13:09:19,940 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 13:09:19,940 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 13:09:19,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 13:09:19,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 13:09:19,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 13:09:19,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 13:09:19,941 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 13:09:19,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 13:09:19,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 13:09:19,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 13:09:19,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 13:09:19,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 13:09:19,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 13:09:19,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 13:09:19,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 13:09:19,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:09:19,943 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 13:09:19,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 13:09:19,944 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-09-16 13:09:19,945 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-09-16 13:09:19,945 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of error function in SV-COMP mode -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2022-09-16 13:09:20,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 13:09:20,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 13:09:20,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 13:09:20,211 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 13:09:20,212 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 13:09:20,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2022-09-16 13:09:20,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce361872/5a899149e5584fefb0be6538210baac1/FLAG8e621e80d [2022-09-16 13:09:20,718 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 13:09:20,718 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2022-09-16 13:09:20,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce361872/5a899149e5584fefb0be6538210baac1/FLAG8e621e80d [2022-09-16 13:09:20,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ce361872/5a899149e5584fefb0be6538210baac1 [2022-09-16 13:09:20,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 13:09:20,745 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 13:09:20,746 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 13:09:20,747 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 13:09:20,749 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 13:09:20,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:09:20" (1/1) ... [2022-09-16 13:09:20,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42937825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:20, skipping insertion in model container [2022-09-16 13:09:20,751 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:09:20" (1/1) ... [2022-09-16 13:09:20,757 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 13:09:20,784 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 13:09:21,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2022-09-16 13:09:21,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:09:21,039 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 13:09:21,084 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4225,4238] [2022-09-16 13:09:21,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:09:21,116 INFO L208 MainTranslator]: Completed translation [2022-09-16 13:09:21,117 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21 WrapperNode [2022-09-16 13:09:21,117 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 13:09:21,118 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 13:09:21,118 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 13:09:21,118 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 13:09:21,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,148 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,200 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 482 [2022-09-16 13:09:21,200 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 13:09:21,201 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 13:09:21,201 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 13:09:21,201 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 13:09:21,215 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,226 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,226 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,242 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,257 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 13:09:21,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 13:09:21,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 13:09:21,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 13:09:21,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (1/1) ... [2022-09-16 13:09:21,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:09:21,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:21,309 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-09-16 13:09:21,319 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-09-16 13:09:21,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 13:09:21,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 13:09:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 13:09:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 13:09:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 13:09:21,351 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 13:09:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 13:09:21,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 13:09:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 13:09:21,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 13:09:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-09-16 13:09:21,352 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-09-16 13:09:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 13:09:21,352 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-09-16 13:09:21,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-09-16 13:09:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-09-16 13:09:21,353 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-09-16 13:09:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 13:09:21,353 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 13:09:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 13:09:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 13:09:21,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 13:09:21,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 13:09:21,356 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-16 13:09:21,524 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 13:09:21,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 13:09:22,102 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 13:09:22,676 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 13:09:22,676 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-09-16 13:09:22,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:09:22 BoogieIcfgContainer [2022-09-16 13:09:22,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 13:09:22,683 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 13:09:22,683 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 13:09:22,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 13:09:22,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 01:09:20" (1/3) ... [2022-09-16 13:09:22,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e56faef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:09:22, skipping insertion in model container [2022-09-16 13:09:22,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:21" (2/3) ... [2022-09-16 13:09:22,688 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e56faef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:09:22, skipping insertion in model container [2022-09-16 13:09:22,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:09:22" (3/3) ... [2022-09-16 13:09:22,689 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2022-09-16 13:09:22,698 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 13:09:22,707 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 13:09:22,707 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-09-16 13:09:22,707 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 13:09:22,983 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2022-09-16 13:09:23,021 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:09:23,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-16 13:09:23,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:23,027 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-09-16 13:09:23,047 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-09-16 13:09:23,064 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-16 13:09:23,076 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread2Thread1of1ForFork1 ======== [2022-09-16 13:09:23,084 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;@7e66e03e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:09:23,085 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-09-16 13:09:23,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:23,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1370990821, now seen corresponding path program 1 times [2022-09-16 13:09:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:23,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655158837] [2022-09-16 13:09:23,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:23,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:23,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655158837] [2022-09-16 13:09:23,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655158837] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:23,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:23,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:09:23,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434123115] [2022-09-16 13:09:23,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:23,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-16 13:09:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:23,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-16 13:09:23,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-16 13:09:23,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:23,653 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:23,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 65.5) internal successors, (131), 2 states have internal predecessors, (131), 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-09-16 13:09:23,654 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:23,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:23,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 13:09:23,680 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:23,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:23,681 INFO L85 PathProgramCache]: Analyzing trace with hash -2142769059, now seen corresponding path program 1 times [2022-09-16 13:09:23,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:23,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100030026] [2022-09-16 13:09:23,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:23,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:23,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:23,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:23,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:23,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100030026] [2022-09-16 13:09:23,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100030026] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:23,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:23,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-16 13:09:23,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103194237] [2022-09-16 13:09:23,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:23,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 13:09:23,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:23,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 13:09:23,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-09-16 13:09:23,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:23,982 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:23,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 21.166666666666668) internal successors, (127), 7 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-09-16 13:09:23,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:23,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:24,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 13:09:24,125 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:24,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2142769058, now seen corresponding path program 1 times [2022-09-16 13:09:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:24,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605572673] [2022-09-16 13:09:24,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:24,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:24,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:24,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605572673] [2022-09-16 13:09:24,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605572673] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:24,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:24,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-09-16 13:09:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720658332] [2022-09-16 13:09:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:24,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 13:09:24,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 13:09:24,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-09-16 13:09:24,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,245 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:24,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 42.333333333333336) internal successors, (127), 4 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-09-16 13:09:24,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:24,245 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:24,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:09:24,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 13:09:24,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:24,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2001329673, now seen corresponding path program 1 times [2022-09-16 13:09:24,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:24,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233315404] [2022-09-16 13:09:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:24,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:24,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:24,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233315404] [2022-09-16 13:09:24,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233315404] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:24,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:24,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-16 13:09:24,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658596498] [2022-09-16 13:09:24,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:24,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-16 13:09:24,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:24,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-16 13:09:24,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-09-16 13:09:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,701 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:24,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.636363636363637) internal successors, (128), 11 states have internal predecessors, (128), 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-09-16 13:09:24,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:24,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:24,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:09:24,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:33,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:09:33,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:09:33,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-16 13:09:33,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:33,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:33,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1755884594, now seen corresponding path program 1 times [2022-09-16 13:09:33,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:33,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672818823] [2022-09-16 13:09:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:33,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:34,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:34,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:34,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:34,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672818823] [2022-09-16 13:09:34,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672818823] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:34,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763660139] [2022-09-16 13:09:34,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:34,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:34,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:34,211 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-09-16 13:09:34,214 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-09-16 13:09:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:34,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 16 conjunts are in the unsatisfiable core [2022-09-16 13:09:34,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:34,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:34,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:34,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763660139] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:34,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:34,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2022-09-16 13:09:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161220046] [2022-09-16 13:09:34,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:34,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-09-16 13:09:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:34,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-09-16 13:09:34,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2022-09-16 13:09:34,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:34,987 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:34,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.318181818181818) internal successors, (205), 22 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 13:09:34,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:34,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:09:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:09:34,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:09:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:09:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:09:43,098 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-09-16 13:09:43,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:43,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1021211735, now seen corresponding path program 2 times [2022-09-16 13:09:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:43,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091881612] [2022-09-16 13:09:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091881612] [2022-09-16 13:09:44,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091881612] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:44,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410154325] [2022-09-16 13:09:44,611 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:09:44,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:44,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:44,612 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-09-16 13:09:44,650 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-09-16 13:09:44,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:09:44,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:09:44,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 61 conjunts are in the unsatisfiable core [2022-09-16 13:09:44,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:44,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 13:09:44,981 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-09-16 13:09:44,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-09-16 13:09:45,487 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:09:45,487 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 15 treesize of output 15 [2022-09-16 13:09:45,948 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:09:46,882 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 18 treesize of output 20 [2022-09-16 13:09:47,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:09:47,032 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 18 treesize of output 20 [2022-09-16 13:09:47,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:09:47,242 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 18 treesize of output 20 [2022-09-16 13:09:47,343 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 17 treesize of output 9 [2022-09-16 13:09:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:47,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:47,491 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_147 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0#1.base| v_ArrVal_147) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) (<= c_~n~0 c_~i1~0)) is different from false [2022-09-16 13:09:47,530 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~i1~0) (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| Int) (v_ArrVal_147 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| v_ArrVal_147) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15|))))) is different from false [2022-09-16 13:09:47,590 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_146) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| v_ArrVal_147) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15|)))) (<= c_~n~0 c_~i1~0)) is different from false [2022-09-16 13:09:48,105 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_146) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| v_ArrVal_147) c_~x~0.base) (+ c_~x~0.offset 4)) 9223372039002259456)))) (<= c_~n~0 0)) is different from false [2022-09-16 13:09:48,166 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_146) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| v_ArrVal_147) |c_ULTIMATE.start_main_#t~ret43#1.base|) (+ |c_ULTIMATE.start_main_#t~ret43#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15|)))) (<= c_~n~0 0)) is different from false [2022-09-16 13:09:48,193 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_146) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15|)))) (<= c_~n~0 0)) is different from false [2022-09-16 13:09:48,228 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| Int) (v_ArrVal_146 (Array Int Int)) (v_ArrVal_145 (Array Int Int)) (v_ArrVal_147 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_145) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_146) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15| v_ArrVal_147) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_15|)))) (<= c_~n~0 0)) is different from false [2022-09-16 13:09:48,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:48,578 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 32 treesize of output 33 [2022-09-16 13:09:48,590 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:48,591 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 156 treesize of output 152 [2022-09-16 13:09:48,604 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 138 treesize of output 122 [2022-09-16 13:09:48,617 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 58 [2022-09-16 13:09:48,628 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 118 treesize of output 110 [2022-09-16 13:09:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:09:50,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410154325] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:50,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:50,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 77 [2022-09-16 13:09:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996026733] [2022-09-16 13:09:50,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:50,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-09-16 13:09:50,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:50,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-09-16 13:09:50,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=4633, Unknown=48, NotChecked=1008, Total=6006 [2022-09-16 13:09:50,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:50,318 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:50,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 5.116883116883117) internal successors, (394), 78 states have internal predecessors, (394), 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-09-16 13:09:50,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:50,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:09:50,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:09:50,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:09:50,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:09:50,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:01,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:01,688 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-09-16 13:10:01,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:01,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:10:01,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:10:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1021211738, now seen corresponding path program 1 times [2022-09-16 13:10:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:10:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958411497] [2022-09-16 13:10:01,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:10:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:10:02,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958411497] [2022-09-16 13:10:02,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958411497] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:10:02,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985246543] [2022-09-16 13:10:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:02,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:02,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:10:02,793 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-09-16 13:10:02,794 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-09-16 13:10:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:02,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 50 conjunts are in the unsatisfiable core [2022-09-16 13:10:02,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:10:03,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 13:10:03,211 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:10:03,212 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-09-16 13:10:03,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:10:03,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:03,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-09-16 13:10:04,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:10:04,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:04,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:10:04,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-09-16 13:10:04,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:04,173 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 17 treesize of output 10 [2022-09-16 13:10:04,179 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:04,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:10:04,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0#1.base| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) is different from false [2022-09-16 13:10:06,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)))) is different from false [2022-09-16 13:10:06,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296))) is different from false [2022-09-16 13:10:06,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296))) is different from false [2022-09-16 13:10:06,405 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-09-16 13:10:06,416 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-09-16 13:10:06,437 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4)) 4294967296))) is different from false [2022-09-16 13:10:06,459 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret43#1.base|) (+ |c_ULTIMATE.start_main_#t~ret43#1.offset| 4)) 4294967296))) is different from false [2022-09-16 13:10:06,475 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967296))) is different from false [2022-09-16 13:10:06,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_192) |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-09-16 13:10:06,536 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:06,536 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 30 treesize of output 31 [2022-09-16 13:10:06,546 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:06,546 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 140 treesize of output 136 [2022-09-16 13:10:06,551 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 122 treesize of output 106 [2022-09-16 13:10:06,557 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 54 treesize of output 50 [2022-09-16 13:10:06,562 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 102 treesize of output 94 [2022-09-16 13:10:07,384 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 10 treesize of output 8 [2022-09-16 13:10:07,409 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-09-16 13:10:07,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985246543] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:10:07,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:10:07,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 60 [2022-09-16 13:10:07,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864936442] [2022-09-16 13:10:07,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:10:07,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-09-16 13:10:07,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:10:07,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-09-16 13:10:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=2357, Unknown=10, NotChecked=1070, Total=3660 [2022-09-16 13:10:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:07,412 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:10:07,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 6.333333333333333) internal successors, (380), 61 states have internal predecessors, (380), 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-09-16 13:10:07,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:07,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:07,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:07,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:07,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:07,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:07,413 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:19,339 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~s11~0 0)) (.cse1 (= c_~s11~0 c_~i1~0))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~x~0.base)) (or (and (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 1) .cse0 .cse1) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)))) (or (and .cse0 (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1) .cse1) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) .cse0 (= c_~x~0.offset 0) (<= (select (select |c_#memory_int| c_~x~0.base) (+ c_~x~0.offset 4)) 2147483647) (< c_~x~0.base |c_#StackHeapBarrier|) .cse1 (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) is different from false [2022-09-16 13:10:21,355 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~x~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| Int)) (or (forall ((v_ArrVal_193 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17| v_ArrVal_193) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t2~0#1.base_17|)))) (= c_~s11~0 0) (= c_~x~0.offset 0) (<= c_~s11~0 c_~i1~0) (<= c_~i1~0 c_~s11~0) (<= (select (select |c_#memory_int| c_~x~0.base) 4) 2147483647)) is different from false [2022-09-16 13:10:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:21,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:21,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:10:21,554 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-09-16 13:10:21,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:21,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:10:21,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:10:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1667253139, now seen corresponding path program 1 times [2022-09-16 13:10:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:10:21,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881636379] [2022-09-16 13:10:21,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:21,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:10:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:10:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881636379] [2022-09-16 13:10:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881636379] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:10:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258933989] [2022-09-16 13:10:21,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:21,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:10:21,944 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-09-16 13:10:21,948 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-09-16 13:10:22,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:22,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 9 conjunts are in the unsatisfiable core [2022-09-16 13:10:22,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:10:22,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-09-16 13:10:22,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-09-16 13:10:22,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258933989] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:10:22,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-09-16 13:10:22,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 12 [2022-09-16 13:10:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667181557] [2022-09-16 13:10:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:10:22,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-09-16 13:10:22,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:10:22,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-09-16 13:10:22,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-09-16 13:10:22,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:22,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:10:22,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 46.0) internal successors, (138), 4 states have internal predecessors, (138), 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-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:10:22,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:29,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:10:29,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:29,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-09-16 13:10:29,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:29,336 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:10:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:10:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash 145241476, now seen corresponding path program 1 times [2022-09-16 13:10:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:10:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344985631] [2022-09-16 13:10:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:10:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:10:29,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344985631] [2022-09-16 13:10:29,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344985631] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:10:29,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264848974] [2022-09-16 13:10:29,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:29,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:29,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:10:29,666 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-09-16 13:10:29,667 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-09-16 13:10:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:29,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 19 conjunts are in the unsatisfiable core [2022-09-16 13:10:29,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:10:30,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:30,184 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:10:30,514 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:30,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264848974] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:10:30,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:10:30,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 14] total 39 [2022-09-16 13:10:30,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265959826] [2022-09-16 13:10:30,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:10:30,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-09-16 13:10:30,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:10:30,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-09-16 13:10:30,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1294, Unknown=0, NotChecked=0, Total=1482 [2022-09-16 13:10:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:30,517 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:10:30,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.948717948717949) internal successors, (349), 39 states have internal predecessors, (349), 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-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:30,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:10:30,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:30,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:10:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:10:40,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:10:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:10:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:10:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:10:40,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:10:41,002 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-09-16 13:10:41,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:41,185 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:10:41,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:10:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1652857802, now seen corresponding path program 1 times [2022-09-16 13:10:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:10:41,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878834278] [2022-09-16 13:10:41,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:41,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:10:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:42,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:42,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:10:42,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878834278] [2022-09-16 13:10:42,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878834278] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:10:42,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090098991] [2022-09-16 13:10:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:42,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:42,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:10:42,063 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-09-16 13:10:42,068 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-09-16 13:10:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:42,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 61 conjunts are in the unsatisfiable core [2022-09-16 13:10:42,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:10:42,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 13:10:42,528 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 13:10:42,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 13:10:42,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:10:43,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:43,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-09-16 13:10:43,990 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 20 treesize of output 22 [2022-09-16 13:10:44,136 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-09-16 13:10:44,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 13:10:44,223 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 13:10:44,224 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 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:10:44,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-09-16 13:10:44,425 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 20 treesize of output 22 [2022-09-16 13:10:44,491 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-09-16 13:10:44,491 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 23 treesize of output 12 [2022-09-16 13:10:44,495 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:10:44,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:10:44,600 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_326 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t3~0#1.base| v_ArrVal_326) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) (<= c_~n~0 c_~i1~0)) is different from false [2022-09-16 13:10:44,638 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0#1.base| v_ArrVal_325) |c_thread1Thread1of1ForFork5_~#t3~0#1.base| v_ArrVal_326) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) (<= c_~n~0 c_~i1~0)) is different from false [2022-09-16 13:10:46,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:46,024 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 35 treesize of output 36 [2022-09-16 13:10:46,035 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:46,036 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 4898 treesize of output 4804 [2022-09-16 13:10:46,060 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 4790 treesize of output 4278 [2022-09-16 13:10:46,082 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 4278 treesize of output 4022 [2022-09-16 13:10:46,106 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 4022 treesize of output 3894 [2022-09-16 13:10:46,129 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 1979 treesize of output 1915 [2022-09-16 13:11:43,496 INFO L356 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2022-09-16 13:11:43,497 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 168 treesize of output 164 [2022-09-16 13:11:43,568 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:43,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090098991] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:43,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:43,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28, 28] total 79 [2022-09-16 13:11:43,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751235042] [2022-09-16 13:11:43,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:43,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-09-16 13:11:43,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:43,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-09-16 13:11:43,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5670, Unknown=46, NotChecked=306, Total=6320 [2022-09-16 13:11:43,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:43,572 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:43,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 79 states have (on average 5.177215189873418) internal successors, (409), 80 states have internal predecessors, (409), 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-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:11:43,573 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:11:43,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:11:43,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:43,574 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-09-16 13:11:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:55,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-09-16 13:11:55,081 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-09-16 13:11:55,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:55,263 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:55,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1020776690, now seen corresponding path program 1 times [2022-09-16 13:11:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:55,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940859396] [2022-09-16 13:11:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:55,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:56,402 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:56,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:56,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940859396] [2022-09-16 13:11:56,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940859396] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:56,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418483867] [2022-09-16 13:11:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:56,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:56,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:56,404 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-09-16 13:11:56,405 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-09-16 13:11:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:56,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 82 conjunts are in the unsatisfiable core [2022-09-16 13:11:56,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:56,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-09-16 13:11:57,181 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 13:11:57,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-09-16 13:11:57,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:11:58,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:58,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 13:11:58,853 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 18 treesize of output 20 [2022-09-16 13:11:58,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:59,004 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 13:11:59,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 29 [2022-09-16 13:11:59,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:59,102 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 13:11:59,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 22 [2022-09-16 13:11:59,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:59,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-09-16 13:11:59,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:59,383 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 18 treesize of output 20 [2022-09-16 13:11:59,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:59,558 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 13:11:59,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:59,653 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 18 treesize of output 20 [2022-09-16 13:11:59,722 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 17 treesize of output 9 [2022-09-16 13:11:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:59,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:59,844 WARN L833 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_393 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread4Thread1of1ForFork2_~#t5~0#1.base| v_ArrVal_393) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))) (<= c_~n~0 c_~i1~0)) is different from false [2022-09-16 13:12:00,221 WARN L833 $PredicateComparison]: unable to prove that (or (<= c_~n~0 c_~i1~0) (forall ((v_ArrVal_391 (Array Int Int)) (|v_thread1Thread1of1ForFork5_~#t3~0#1.base_23| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int)) (|v_thread4Thread1of1ForFork2_~#t5~0#1.base_18| Int)) (or (not (= (select (store |c_#valid| |v_thread1Thread1of1ForFork5_~#t3~0#1.base_23| 1) |v_thread4Thread1of1ForFork2_~#t5~0#1.base_18|) 0)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork5_~#t3~0#1.base_23|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_thread1Thread1of1ForFork5_~#t2~0#1.base| v_ArrVal_391) |v_thread1Thread1of1ForFork5_~#t3~0#1.base_23| v_ArrVal_392) |v_thread4Thread1of1ForFork2_~#t5~0#1.base_18| v_ArrVal_393) c_~x~0.base) (+ c_~x~0.offset 4 (* c_~i1~0 4))) 9223372039002259456))))) is different from false [2022-09-16 13:12:02,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:12:02,052 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 38 treesize of output 39 [2022-09-16 13:12:02,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:12:02,068 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 19522 treesize of output 19332 [2022-09-16 13:12:02,133 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 19318 treesize of output 18294 [2022-09-16 13:12:02,199 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 18294 treesize of output 16246 [2022-09-16 13:12:02,272 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 16246 treesize of output 16118 [2022-09-16 13:12:02,367 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 16118 treesize of output 15862 [2022-09-16 13:12:02,512 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 15862 treesize of output 15350 Received shutdown request... [2022-09-16 13:23:05,101 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 13:23:05,101 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-09-16 13:23:05,101 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-09-16 13:23:05,101 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-09-16 13:23:05,119 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-09-16 13:23:05,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-09-16 13:23:05,304 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-09-16 13:23:05,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-09-16 13:23:05,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-09-16 13:23:05,305 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-09-16 13:23:05,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-09-16 13:23:05,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-09-16 13:23:05,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-09-16 13:23:05,306 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-09-16 13:23:05,310 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 13:23:05,311 INFO L307 ceAbstractionStarter]: Result for error location thread2Thread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/7) [2022-09-16 13:23:05,313 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 13:23:05,313 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 13:23:05,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 01:23:05 BasicIcfg [2022-09-16 13:23:05,315 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 13:23:05,315 INFO L158 Benchmark]: Toolchain (without parser) took 824570.78ms. Allocated memory was 177.2MB in the beginning and 4.2GB in the end (delta: 4.1GB). Free memory was 148.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.4GB. Max. memory is 8.0GB. [2022-09-16 13:23:05,315 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 177.2MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 13:23:05,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 370.50ms. Allocated memory was 177.2MB in the beginning and 250.6MB in the end (delta: 73.4MB). Free memory was 147.8MB in the beginning and 219.1MB in the end (delta: -71.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-09-16 13:23:05,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.55ms. Allocated memory is still 250.6MB. Free memory was 219.1MB in the beginning and 215.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 13:23:05,316 INFO L158 Benchmark]: Boogie Preprocessor took 58.44ms. Allocated memory is still 250.6MB. Free memory was 215.7MB in the beginning and 213.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 13:23:05,316 INFO L158 Benchmark]: RCFGBuilder took 1420.21ms. Allocated memory is still 250.6MB. Free memory was 213.2MB in the beginning and 152.6MB in the end (delta: 60.6MB). Peak memory consumption was 87.3MB. Max. memory is 8.0GB. [2022-09-16 13:23:05,317 INFO L158 Benchmark]: TraceAbstraction took 822632.10ms. Allocated memory was 250.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 152.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-09-16 13:23:05,318 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.52ms. Allocated memory is still 177.2MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 370.50ms. Allocated memory was 177.2MB in the beginning and 250.6MB in the end (delta: 73.4MB). Free memory was 147.8MB in the beginning and 219.1MB in the end (delta: -71.3MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 82.55ms. Allocated memory is still 250.6MB. Free memory was 219.1MB in the beginning and 215.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 58.44ms. Allocated memory is still 250.6MB. Free memory was 215.7MB in the beginning and 213.2MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1420.21ms. Allocated memory is still 250.6MB. Free memory was 213.2MB in the beginning and 152.6MB in the end (delta: 60.6MB). Peak memory consumption was 87.3MB. Max. memory is 8.0GB. * TraceAbstraction took 822632.10ms. Allocated memory was 250.6MB in the beginning and 4.2GB in the end (delta: 4.0GB). Free memory was 152.1MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21980994, positive: 16607918, positive conditional: 16588198, positive unconditional: 19720, negative: 5373076, negative conditional: 5372951, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16645841, positive: 16607918, positive conditional: 16588198, positive unconditional: 19720, negative: 37923, negative conditional: 37798, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16645841, positive: 16607918, positive conditional: 16588198, positive unconditional: 19720, negative: 37923, negative conditional: 37798, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16988708, positive: 16607918, positive conditional: 91790, positive unconditional: 16516128, negative: 380790, negative conditional: 251077, negative unconditional: 129713, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16988708, positive: 16607918, positive conditional: 91790, positive unconditional: 16516128, negative: 380790, negative conditional: 79344, negative unconditional: 301446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16988708, positive: 16607918, positive conditional: 91790, positive unconditional: 16516128, negative: 380790, negative conditional: 79344, negative unconditional: 301446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17649, positive: 17348, positive conditional: 69, positive unconditional: 17279, negative: 301, negative conditional: 174, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17649, positive: 17248, positive conditional: 0, positive unconditional: 17248, negative: 401, negative conditional: 0, negative unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 401, positive: 100, positive conditional: 69, positive unconditional: 31, negative: 299, negative conditional: 172, negative unconditional: 127, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 990, positive: 295, positive conditional: 213, positive unconditional: 82, negative: 690, negative conditional: 420, negative unconditional: 269, unknown: 6, unknown conditional: 6, unknown unconditional: 0] ], Cache Queries: [ total: 16988708, positive: 16590570, positive conditional: 91721, positive unconditional: 16498849, negative: 380489, negative conditional: 79170, negative unconditional: 301319, unknown: 17649, unknown conditional: 243, unknown unconditional: 17406] , Statistics on independence cache: Total cache size (in pairs): 17649, Positive cache size: 17348, Positive conditional cache size: 69, Positive unconditional cache size: 17279, Negative cache size: 301, Negative conditional cache size: 174, Negative unconditional cache size: 127, Eliminated conditions: 171733, Maximal queried relation: 9, Independence queries for same thread: 5335153 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 1.6s, Number of persistent set computation: 15323, Number of trivial persistent sets: 6590, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 19845, positive: 19720, positive conditional: 0, positive unconditional: 19720, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 21980994, positive: 16607918, positive conditional: 16588198, positive unconditional: 19720, negative: 5373076, negative conditional: 5372951, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16645841, positive: 16607918, positive conditional: 16588198, positive unconditional: 19720, negative: 37923, negative conditional: 37798, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 16645841, positive: 16607918, positive conditional: 16588198, positive unconditional: 19720, negative: 37923, negative conditional: 37798, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 16988708, positive: 16607918, positive conditional: 91790, positive unconditional: 16516128, negative: 380790, negative conditional: 251077, negative unconditional: 129713, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 16988708, positive: 16607918, positive conditional: 91790, positive unconditional: 16516128, negative: 380790, negative conditional: 79344, negative unconditional: 301446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 16988708, positive: 16607918, positive conditional: 91790, positive unconditional: 16516128, negative: 380790, negative conditional: 79344, negative unconditional: 301446, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 17649, positive: 17348, positive conditional: 69, positive unconditional: 17279, negative: 301, negative conditional: 174, negative unconditional: 127, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 17649, positive: 17248, positive conditional: 0, positive unconditional: 17248, negative: 401, negative conditional: 0, negative unconditional: 401, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 401, positive: 100, positive conditional: 69, positive unconditional: 31, negative: 299, negative conditional: 172, negative unconditional: 127, unknown: 2, unknown conditional: 2, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 990, positive: 295, positive conditional: 213, positive unconditional: 82, negative: 690, negative conditional: 420, negative unconditional: 269, unknown: 6, unknown conditional: 6, unknown unconditional: 0] ], Cache Queries: [ total: 16988708, positive: 16590570, positive conditional: 91721, positive unconditional: 16498849, negative: 380489, negative conditional: 79170, negative unconditional: 301319, unknown: 17649, unknown conditional: 243, unknown unconditional: 17406] , Statistics on independence cache: Total cache size (in pairs): 17649, Positive cache size: 17348, Positive conditional cache size: 69, Positive unconditional cache size: 17279, Negative cache size: 301, Negative conditional cache size: 174, Negative unconditional cache size: 127, Eliminated conditions: 171733, Maximal queried relation: 9, Independence queries for same thread: 5335153 - TimeoutResultAtElement [Line: 183]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 183]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 184]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 184]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 185]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 185]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 165 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread2Thread1of1ForFork1 with 1 thread instances CFG has 13 procedures, 458 locations, 102 error locations. Started 1 CEGAR loops. OverallTime: 822.3s, OverallIterations: 11, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 72.2s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 247, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 76.7s InterpolantComputationTime, 2271 NumberOfCodeBlocks, 2271 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2980 ConstructedInterpolants, 237 QuantifiedInterpolants, 37919 SizeOfPredicates, 170 NumberOfNonLiveVariables, 2125 ConjunctsInSsa, 216 ConjunctsInUnsatCore, 21 InterpolantComputations, 5 PerfectInterpolantSequences, 20/175 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown