/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-equiv.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-53ca081-m [2022-09-16 13:09:39,469 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-16 13:09:39,471 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-16 13:09:39,507 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-16 13:09:39,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-16 13:09:39,510 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-16 13:09:39,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-16 13:09:39,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-16 13:09:39,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-16 13:09:39,523 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-16 13:09:39,524 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-16 13:09:39,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-16 13:09:39,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-16 13:09:39,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-16 13:09:39,528 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-16 13:09:39,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-16 13:09:39,531 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-16 13:09:39,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-16 13:09:39,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-16 13:09:39,539 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-16 13:09:39,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-16 13:09:39,541 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-16 13:09:39,543 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-16 13:09:39,543 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-16 13:09:39,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-16 13:09:39,550 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-16 13:09:39,550 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-16 13:09:39,551 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-16 13:09:39,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-16 13:09:39,552 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-16 13:09:39,553 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-16 13:09:39,553 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-16 13:09:39,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-16 13:09:39,555 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-16 13:09:39,556 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-16 13:09:39,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-16 13:09:39,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-16 13:09:39,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-16 13:09:39,557 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-16 13:09:39,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-16 13:09:39,559 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-16 13:09:39,559 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:39,602 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-16 13:09:39,602 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-16 13:09:39,603 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-09-16 13:09:39,603 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-09-16 13:09:39,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-16 13:09:39,604 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-16 13:09:39,604 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-16 13:09:39,604 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-16 13:09:39,604 INFO L138 SettingsManager]: * Use SBE=true [2022-09-16 13:09:39,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-16 13:09:39,605 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-16 13:09:39,605 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-16 13:09:39,606 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-16 13:09:39,607 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-16 13:09:39,607 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-16 13:09:39,607 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-16 13:09:39,607 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-16 13:09:39,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:09:39,607 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-16 13:09:39,607 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-16 13:09:39,607 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-09-16 13:09:39,608 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-09-16 13:09:39,608 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:39,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-16 13:09:39,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-16 13:09:39,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-16 13:09:39,868 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-16 13:09:39,871 INFO L275 PluginConnector]: CDTParser initialized [2022-09-16 13:09:39,872 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-09-16 13:09:39,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930456172/75abb00aa3c748c59605ff011ae7f7a6/FLAG176aa2e23 [2022-09-16 13:09:40,379 INFO L306 CDTParser]: Found 1 translation units. [2022-09-16 13:09:40,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-equiv.wvr.c [2022-09-16 13:09:40,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930456172/75abb00aa3c748c59605ff011ae7f7a6/FLAG176aa2e23 [2022-09-16 13:09:40,401 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/930456172/75abb00aa3c748c59605ff011ae7f7a6 [2022-09-16 13:09:40,403 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-16 13:09:40,404 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-16 13:09:40,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-16 13:09:40,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-16 13:09:40,408 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-16 13:09:40,409 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:09:40" (1/1) ... [2022-09-16 13:09:40,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798ffef7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:40, skipping insertion in model container [2022-09-16 13:09:40,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 01:09:40" (1/1) ... [2022-09-16 13:09:40,415 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-16 13:09:40,433 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-16 13:09:40,593 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-equiv.wvr.c[3770,3783] [2022-09-16 13:09:40,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:09:40,605 INFO L203 MainTranslator]: Completed pre-run [2022-09-16 13:09:40,628 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-equiv.wvr.c[3770,3783] [2022-09-16 13:09:40,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-16 13:09:40,647 INFO L208 MainTranslator]: Completed translation [2022-09-16 13:09:40,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:40 WrapperNode [2022-09-16 13:09:40,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-16 13:09:40,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-16 13:09:40,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-16 13:09:40,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-16 13:09:40,653 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:40" (1/1) ... [2022-09-16 13:09:40,660 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:40" (1/1) ... [2022-09-16 13:09:40,685 INFO L138 Inliner]: procedures = 27, calls = 73, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 297 [2022-09-16 13:09:40,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-16 13:09:40,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-16 13:09:40,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-16 13:09:40,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-16 13:09:40,693 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:40" (1/1) ... [2022-09-16 13:09:40,693 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:40" (1/1) ... [2022-09-16 13:09:40,697 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:40" (1/1) ... [2022-09-16 13:09:40,697 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:40" (1/1) ... [2022-09-16 13:09:40,709 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:40" (1/1) ... [2022-09-16 13:09:40,727 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:40" (1/1) ... [2022-09-16 13:09:40,729 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:40" (1/1) ... [2022-09-16 13:09:40,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-16 13:09:40,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-16 13:09:40,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-16 13:09:40,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-16 13:09:40,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:40" (1/1) ... [2022-09-16 13:09:40,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-16 13:09:40,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:40,770 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:40,784 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:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-16 13:09:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-16 13:09:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-16 13:09:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-09-16 13:09:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-09-16 13:09:40,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-09-16 13:09:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-09-16 13:09:40,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-09-16 13:09:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-09-16 13:09:40,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-09-16 13:09:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-09-16 13:09:40,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-09-16 13:09:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-16 13:09:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-16 13:09:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-16 13:09:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-09-16 13:09:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-16 13:09:40,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-16 13:09:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-16 13:09:40,807 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:40,892 INFO L234 CfgBuilder]: Building ICFG [2022-09-16 13:09:40,893 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-16 13:09:41,347 INFO L275 CfgBuilder]: Performing block encoding [2022-09-16 13:09:41,704 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-16 13:09:41,705 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-09-16 13:09:41,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:09:41 BoogieIcfgContainer [2022-09-16 13:09:41,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-16 13:09:41,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-16 13:09:41,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-16 13:09:41,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-16 13:09:41,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 01:09:40" (1/3) ... [2022-09-16 13:09:41,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562a451b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:09:41, skipping insertion in model container [2022-09-16 13:09:41,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 01:09:40" (2/3) ... [2022-09-16 13:09:41,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562a451b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 01:09:41, skipping insertion in model container [2022-09-16 13:09:41,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 01:09:41" (3/3) ... [2022-09-16 13:09:41,717 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2022-09-16 13:09:41,723 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-09-16 13:09:41,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-16 13:09:41,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-09-16 13:09:41,730 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-16 13:09:41,875 INFO L144 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2022-09-16 13:09:41,917 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:09:41,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-09-16 13:09:41,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:41,919 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:41,921 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:41,950 INFO L156 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-09-16 13:09:41,962 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread2Thread1of1ForFork1 ======== [2022-09-16 13:09:41,970 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;@28cb26a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-16 13:09:41,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-09-16 13:09:42,222 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:42,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:42,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1925841134, now seen corresponding path program 1 times [2022-09-16 13:09:42,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:42,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918217541] [2022-09-16 13:09:42,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:42,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:42,439 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:42,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:42,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918217541] [2022-09-16 13:09:42,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918217541] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:42,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:42,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:09:42,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573376946] [2022-09-16 13:09:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:42,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-09-16 13:09:42,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-09-16 13:09:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-09-16 13:09:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,475 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:42,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 54.0) internal successors, (108), 2 states have internal predecessors, (108), 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:42,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-16 13:09:42,530 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:42,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:42,531 INFO L85 PathProgramCache]: Analyzing trace with hash 2045540372, now seen corresponding path program 1 times [2022-09-16 13:09:42,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:42,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490288186] [2022-09-16 13:09:42,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:42,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:42,659 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:42,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:42,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490288186] [2022-09-16 13:09:42,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490288186] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:42,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:42,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:09:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832460612] [2022-09-16 13:09:42,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:42,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 13:09:42,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:42,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 13:09:42,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 13:09:42,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,663 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:42,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 52.5) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 13:09:42,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,664 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:42,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-16 13:09:42,777 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:42,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:42,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1012756775, now seen corresponding path program 1 times [2022-09-16 13:09:42,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:42,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726982485] [2022-09-16 13:09:42,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:42,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:42,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:42,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:42,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726982485] [2022-09-16 13:09:42,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726982485] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:42,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:42,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-16 13:09:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471589835] [2022-09-16 13:09:42,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:42,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 13:09:42,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:42,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 13:09:42,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-16 13:09:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:42,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 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:42,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:42,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:42,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:43,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:43,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-16 13:09:43,592 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:43,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:43,593 INFO L85 PathProgramCache]: Analyzing trace with hash 170708326, now seen corresponding path program 1 times [2022-09-16 13:09:43,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:43,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725877857] [2022-09-16 13:09:43,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:43,767 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:43,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725877857] [2022-09-16 13:09:43,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725877857] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:43,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944987936] [2022-09-16 13:09:43,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:43,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:43,770 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:43,772 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:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:43,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 12 conjunts are in the unsatisfiable core [2022-09-16 13:09:43,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:44,114 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:44,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:44,325 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:44,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944987936] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:44,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:44,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-09-16 13:09:44,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434891833] [2022-09-16 13:09:44,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:44,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-09-16 13:09:44,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:44,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-09-16 13:09:44,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2022-09-16 13:09:44,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:44,331 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:44,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 9.11111111111111) internal successors, (164), 18 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 13:09:44,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:44,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:44,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:44,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:44,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:44,911 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:45,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-09-16 13:09:45,092 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:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash -725901959, now seen corresponding path program 2 times [2022-09-16 13:09:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:45,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466659213] [2022-09-16 13:09:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:45,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:45,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:09:45,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:45,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466659213] [2022-09-16 13:09:45,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466659213] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:45,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652233590] [2022-09-16 13:09:45,727 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:09:45,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:45,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:45,760 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:45,762 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:45,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:09:45,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:09:45,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 13:09:45,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:46,076 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:46,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:09:46,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:09:46,631 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:46,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:09:46,737 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:46,787 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:09:46,788 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:09:46,875 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:46,938 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 21 treesize of output 9 [2022-09-16 13:09:46,941 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:46,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:47,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (< 0 (+ 9223372039002259456 (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_130) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0)))))) is different from false [2022-09-16 13:09:47,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_130 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_130) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 13:09:47,618 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:47,619 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:47,631 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:47,631 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 1234 treesize of output 1188 [2022-09-16 13:09:47,650 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 1174 treesize of output 1046 [2022-09-16 13:09:47,664 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 1046 treesize of output 1014 [2022-09-16 13:09:47,678 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 1014 treesize of output 950 [2022-09-16 13:09:48,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:48,687 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 29 treesize of output 34 [2022-09-16 13:09:48,936 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:48,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652233590] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:48,937 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:48,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 13:09:48,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33123472] [2022-09-16 13:09:48,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:48,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 13:09:48,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:48,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 13:09:48,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2471, Unknown=18, NotChecked=202, Total=2862 [2022-09-16 13:09:48,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:48,939 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:48,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 5.245283018867925) internal successors, (278), 54 states have internal predecessors, (278), 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:48,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:48,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:48,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:48,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:48,940 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:51,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:51,645 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:09:51,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:51,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:51,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash -725901956, now seen corresponding path program 1 times [2022-09-16 13:09:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:51,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98321587] [2022-09-16 13:09:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:52,278 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:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98321587] [2022-09-16 13:09:52,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98321587] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126213792] [2022-09-16 13:09:52,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:52,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:52,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:52,288 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:09:52,288 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:09:52,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:52,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjunts are in the unsatisfiable core [2022-09-16 13:09:52,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:52,434 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:52,457 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 13:09:52,459 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 14 [2022-09-16 13:09:52,619 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 13:09:52,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 13:09:52,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:09:53,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, 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:09:53,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:09:53,430 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 13:09:53,430 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:09:53,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:09:53,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 13:09:53,561 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:53,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:53,673 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_178) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:09:53,686 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_178) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 13:09:54,075 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:54,076 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:09:54,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:09:54,085 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:09:54,090 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:09:54,095 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 106 treesize of output 98 [2022-09-16 13:09:54,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-09-16 13:09:55,094 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:55,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126213792] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:55,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:55,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 55 [2022-09-16 13:09:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580849322] [2022-09-16 13:09:55,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-09-16 13:09:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:55,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-09-16 13:09:55,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=2612, Unknown=18, NotChecked=210, Total=3080 [2022-09-16 13:09:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:55,098 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:55,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 5.9818181818181815) internal successors, (329), 56 states have internal predecessors, (329), 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:55,098 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:55,099 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:56,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:56,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:09:56,986 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:09:57,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:57,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash -725901955, now seen corresponding path program 1 times [2022-09-16 13:09:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:57,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332136204] [2022-09-16 13:09:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:09:57,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:57,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332136204] [2022-09-16 13:09:57,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332136204] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:57,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:57,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:09:57,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319037683] [2022-09-16 13:09:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:57,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 13:09:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:57,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 13:09:57,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 13:09:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,255 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:57,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 57.5) internal successors, (115), 3 states have internal predecessors, (115), 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:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:09:57,256 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:09:57,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-16 13:09:57,453 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:09:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:57,454 INFO L85 PathProgramCache]: Analyzing trace with hash -183691799, now seen corresponding path program 1 times [2022-09-16 13:09:57,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:57,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523169628] [2022-09-16 13:09:57,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:57,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:57,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:57,528 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:09:57,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523169628] [2022-09-16 13:09:57,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523169628] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:57,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110640670] [2022-09-16 13:09:57,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:57,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:57,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:57,532 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:09:57,540 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:09:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:57,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjunts are in the unsatisfiable core [2022-09-16 13:09:57,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:09:57,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:57,720 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:09:57,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110640670] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:57,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:57,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-09-16 13:09:57,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568169487] [2022-09-16 13:09:57,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:57,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-16 13:09:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-16 13:09:57,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-09-16 13:09:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,723 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:57,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 23.0) internal successors, (138), 7 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:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,723 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:57,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:09:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:09:57,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-09-16 13:09:58,135 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:09:58,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:09:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash -183691798, now seen corresponding path program 1 times [2022-09-16 13:09:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:58,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422629193] [2022-09-16 13:09:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:58,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-09-16 13:09:58,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:58,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422629193] [2022-09-16 13:09:58,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422629193] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:09:58,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:09:58,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:09:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581731056] [2022-09-16 13:09:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:09:58,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 13:09:58,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:58,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 13:09:58,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 13:09:58,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:58,191 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:58,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 59.0) internal successors, (118), 3 states have internal predecessors, (118), 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:58,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:58,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:58,191 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:58,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:58,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2022-09-16 13:09:58,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:09:58,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:58,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:09:58,192 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:09:58,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:09:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:58,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-16 13:09:58,466 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:09:58,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:09:58,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1399477340, now seen corresponding path program 1 times [2022-09-16 13:09:58,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:09:58,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822973723] [2022-09-16 13:09:58,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:58,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:09:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:58,629 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:09:58,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:09:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822973723] [2022-09-16 13:09:58,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822973723] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:09:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679962709] [2022-09-16 13:09:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:09:58,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:09:58,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:09:58,631 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:09:58,632 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:09:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:09:58,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 15 conjunts are in the unsatisfiable core [2022-09-16 13:09:58,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:09:58,980 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:09:58,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:09:59,217 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:09:59,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679962709] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:09:59,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:09:59,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2022-09-16 13:09:59,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321137907] [2022-09-16 13:09:59,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:09:59,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-09-16 13:09:59,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:09:59,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-09-16 13:09:59,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=555, Unknown=0, NotChecked=0, Total=702 [2022-09-16 13:09:59,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:59,220 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:09:59,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 7.666666666666667) internal successors, (207), 27 states have internal predecessors, (207), 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:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:09:59,220 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:09:59,221 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:00,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 13:10:00,142 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:00,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:00,332 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:10:00,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:10:00,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1451725827, now seen corresponding path program 1 times [2022-09-16 13:10:00,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:10:00,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024997443] [2022-09-16 13:10:00,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:00,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:10:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:00,917 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:00,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:10:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024997443] [2022-09-16 13:10:00,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024997443] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:10:00,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149941752] [2022-09-16 13:10:00,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:00,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:00,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:10:00,919 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:00,926 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:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:01,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 45 conjunts are in the unsatisfiable core [2022-09-16 13:10:01,067 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:10:01,479 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:10:01,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:01,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:10:01,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:01,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:10:01,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:01,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:10:02,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:02,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:10:02,072 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:10:02,075 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,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:10:02,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:10:02,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_347) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:10:02,156 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_347) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 13:10:02,165 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int)) (or (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) is different from false [2022-09-16 13:10:04,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int)) (or (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)))) is different from false [2022-09-16 13:10:04,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) is different from false [2022-09-16 13:10:04,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) is different from false [2022-09-16 13:10:04,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) is different from false [2022-09-16 13:10:04,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |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_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) is different from false [2022-09-16 13:10:04,392 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |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_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) is different from false [2022-09-16 13:10:04,463 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:04,463 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:04,473 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:04,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1226 treesize of output 1204 [2022-09-16 13:10:04,485 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 1190 treesize of output 1062 [2022-09-16 13:10:04,496 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 1062 treesize of output 998 [2022-09-16 13:10:04,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 998 treesize of output 966 [2022-09-16 13:10:04,524 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 490 treesize of output 474 [2022-09-16 13:10:05,592 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:05,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149941752] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:10:05,592 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:10:05,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 59 [2022-09-16 13:10:05,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012726124] [2022-09-16 13:10:05,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:10:05,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-09-16 13:10:05,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:10:05,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-09-16 13:10:05,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2239, Unknown=10, NotChecked=1050, Total=3540 [2022-09-16 13:10:05,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:05,597 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:10:05,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 5.796610169491525) internal successors, (342), 60 states have internal predecessors, (342), 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:05,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:05,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:05,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:10:05,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:10:05,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:10:05,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:10:05,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:05,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:10:05,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:05,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-09-16 13:10:05,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:07,045 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |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_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 1))) is different from false [2022-09-16 13:10:07,048 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |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_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:10:07,051 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= 0 (+ (select .cse0 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |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_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (<= 0 (+ (select .cse0 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:10:07,054 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (and (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483648)) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |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_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 4) 2147483648)) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1))) is different from false [2022-09-16 13:10:07,057 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret27#1.base|) 1) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse0 4) 2147483648)) (<= 0 (+ (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 2147483648)) (<= (+ |c_ULTIMATE.start_main_#t~ret27#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 13:10:07,061 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int) (v_ArrVal_346 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int) (v_ArrVal_345 (Array Int Int))) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_345) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_346) |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:10:09,164 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int)) (or (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:10:49,192 WARN L833 $PredicateComparison]: unable to prove that (and (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483648)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_21| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_21| Int)) (or (forall ((v_ArrVal_348 (Array Int Int)) (v_ArrVal_347 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_21| v_ArrVal_347) |v_thread1Thread1of1ForFork2_~#t3~0.base_21| v_ArrVal_348) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_21|)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_21|)))) (= (select |c_#valid| c_~X_0~0.base) 1) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:10:50,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-09-16 13:10:50,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:10:50,589 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:10:50,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:50,779 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:10:50,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:10:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash -25486814, now seen corresponding path program 2 times [2022-09-16 13:10:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:10:50,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553131199] [2022-09-16 13:10:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:10:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:10:50,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:10:51,267 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:51,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:10:51,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553131199] [2022-09-16 13:10:51,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553131199] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:10:51,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510305681] [2022-09-16 13:10:51,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:10:51,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:10:51,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:10:51,270 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:10:51,270 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:10:51,392 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:10:51,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:10:51,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 44 conjunts are in the unsatisfiable core [2022-09-16 13:10:51,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:10:51,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:10:51,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:51,996 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:52,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:52,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:52,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:10:52,167 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:52,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 13:10:52,200 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:52,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:10:52,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:10:52,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:10:52,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 13:10:52,326 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) is different from false [2022-09-16 13:10:52,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296))) is different from false [2022-09-16 13:10:52,382 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 4294967296))) is different from false [2022-09-16 13:10:52,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)))) is different from false [2022-09-16 13:10:52,404 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int) (v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_391) |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) |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:52,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:52,451 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:52,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:10:52,459 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 1106 treesize of output 1060 [2022-09-16 13:10:52,469 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 1046 treesize of output 982 [2022-09-16 13:10:52,479 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 982 treesize of output 854 [2022-09-16 13:10:52,520 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 854 treesize of output 822 [2022-09-16 13:10:56,676 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:56,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510305681] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:10:56,677 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:10:56,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 53 [2022-09-16 13:10:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529750486] [2022-09-16 13:10:56,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:10:56,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-09-16 13:10:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:10:56,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-09-16 13:10:56,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=1857, Unknown=8, NotChecked=760, Total=2862 [2022-09-16 13:10:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:56,681 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:10:56,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 6.037735849056604) internal successors, (320), 54 states have internal predecessors, (320), 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:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:10:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:10:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:10:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:10:56,682 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:56,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:10:56,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:10:56,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-09-16 13:10:56,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:10:56,683 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:10:59,984 WARN L833 $PredicateComparison]: unable to prove that (and (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) 2147483647) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:11:01,987 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_23| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_23|)) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_392 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_23| v_ArrVal_392) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_393) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)))) (<= (select (select |c_#memory_int| c_~X_0~0.base) 4) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:11:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:03,567 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:11:03,751 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,SelfDestructingSolverStorable11 [2022-09-16 13:11:03,752 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash -683003194, now seen corresponding path program 3 times [2022-09-16 13:11:03,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:03,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001991076] [2022-09-16 13:11:03,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:03,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:04,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:04,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001991076] [2022-09-16 13:11:04,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001991076] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:04,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602034081] [2022-09-16 13:11:04,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 13:11:04,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:04,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:04,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 13:11:04,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-09-16 13:11:04,455 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-09-16 13:11:04,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:11:04,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 52 conjunts are in the unsatisfiable core [2022-09-16 13:11:04,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:04,463 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:04,488 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 13:11:04,488 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 14 [2022-09-16 13:11:04,651 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 13:11:04,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 13:11:04,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:11:05,125 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 13:11:05,126 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-09-16 13:11:05,430 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:05,549 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:05,632 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 13:11:05,633 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:05,716 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:05,760 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 21 treesize of output 9 [2022-09-16 13:11:05,763 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:05,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:05,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_447) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:11:05,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_447) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 13:11:06,460 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:11:06,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-09-16 13:11:06,470 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:06,470 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 618 treesize of output 596 [2022-09-16 13:11:06,478 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 582 treesize of output 518 [2022-09-16 13:11:06,485 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 518 treesize of output 486 [2022-09-16 13:11:06,491 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 486 treesize of output 470 [2022-09-16 13:11:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:07,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602034081] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:07,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:07,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 63 [2022-09-16 13:11:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363890855] [2022-09-16 13:11:07,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:07,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-09-16 13:11:07,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:07,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-09-16 13:11:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=3451, Unknown=42, NotChecked=242, Total=4032 [2022-09-16 13:11:07,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:07,698 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:07,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 5.650793650793651) internal successors, (356), 64 states have internal predecessors, (356), 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:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:07,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:07,699 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:10,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:11:10,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-09-16 13:11:10,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-09-16 13:11:10,805 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:10,806 INFO L85 PathProgramCache]: Analyzing trace with hash -683003191, now seen corresponding path program 3 times [2022-09-16 13:11:10,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:10,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79374612] [2022-09-16 13:11:10,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:10,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:11,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79374612] [2022-09-16 13:11:11,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79374612] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:11,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49938240] [2022-09-16 13:11:11,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 13:11:11,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:11,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:11,281 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 13:11:11,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-09-16 13:11:11,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-09-16 13:11:11,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:11:11,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 47 conjunts are in the unsatisfiable core [2022-09-16 13:11:11,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:11,631 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:11,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:11:11,951 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-09-16 13:11:11,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 30 [2022-09-16 13:11:12,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:12,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:12,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:12,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:12,230 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:11:12,230 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:11:12,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:12,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 13:11:12,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-09-16 13:11:12,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:12,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_499) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:11:12,417 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_499 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_499) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 13:11:12,919 INFO L356 Elim1Store]: treesize reduction 20, result has 63.0 percent of original size [2022-09-16 13:11:12,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 52 [2022-09-16 13:11:12,937 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:12,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 170 [2022-09-16 13:11:12,943 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:11:12,950 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:11:12,956 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:11:13,582 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:13,583 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 29 treesize of output 34 [2022-09-16 13:11:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 23 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:13,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49938240] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:13,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:13,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 58 [2022-09-16 13:11:13,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329178252] [2022-09-16 13:11:13,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:13,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-09-16 13:11:13,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:13,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-09-16 13:11:13,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=2973, Unknown=35, NotChecked=222, Total=3422 [2022-09-16 13:11:13,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:13,799 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:13,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 5.155172413793103) internal successors, (299), 59 states have internal predecessors, (299), 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:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:11:13,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:17,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:17,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-09-16 13:11:17,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-09-16 13:11:17,540 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:17,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:17,541 INFO L85 PathProgramCache]: Analyzing trace with hash -267464079, now seen corresponding path program 2 times [2022-09-16 13:11:17,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:17,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710398517] [2022-09-16 13:11:17,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:17,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:17,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:18,084 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:18,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:18,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710398517] [2022-09-16 13:11:18,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710398517] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:18,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833235681] [2022-09-16 13:11:18,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:11:18,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:18,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:18,085 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-09-16 13:11:18,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-09-16 13:11:18,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:11:18,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:11:18,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 53 conjunts are in the unsatisfiable core [2022-09-16 13:11:18,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:18,330 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:18,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:11:18,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:18,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 16 treesize of output 18 [2022-09-16 13:11:18,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:18,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:18,990 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:11:18,991 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:11:19,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:19,069 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:19,071 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:19,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:19,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_549) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:11:19,159 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_549 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_549) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-09-16 13:11:19,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:19,518 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:11:19,525 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:19,526 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 310 treesize of output 300 [2022-09-16 13:11:19,532 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 143 treesize of output 127 [2022-09-16 13:11:19,537 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 270 treesize of output 238 [2022-09-16 13:11:19,541 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 238 treesize of output 230 [2022-09-16 13:11:20,236 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:20,236 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 29 treesize of output 34 [2022-09-16 13:11:20,416 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:20,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833235681] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:20,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:20,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 59 [2022-09-16 13:11:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774026951] [2022-09-16 13:11:20,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:20,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-09-16 13:11:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-09-16 13:11:20,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3109, Unknown=18, NotChecked=226, Total=3540 [2022-09-16 13:11:20,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:20,418 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:20,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 5.237288135593221) internal successors, (309), 60 states have internal predecessors, (309), 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:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:20,419 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:24,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:24,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-09-16 13:11:24,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-09-16 13:11:24,216 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:24,216 INFO L85 PathProgramCache]: Analyzing trace with hash -267464076, now seen corresponding path program 1 times [2022-09-16 13:11:24,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:24,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370661944] [2022-09-16 13:11:24,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:24,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:24,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370661944] [2022-09-16 13:11:24,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370661944] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:24,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127698412] [2022-09-16 13:11:24,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:24,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:24,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:24,669 INFO L229 MonitoredProcess]: Starting monitored process 13 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:24,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-09-16 13:11:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:24,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 51 conjunts are in the unsatisfiable core [2022-09-16 13:11:24,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:24,799 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:24,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 13:11:24,818 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 14 [2022-09-16 13:11:24,978 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-09-16 13:11:24,978 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 16 treesize of output 18 [2022-09-16 13:11:25,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:11:25,434 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:11:25,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:25,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:25,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:11:25,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 13:11:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:25,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:25,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:11:25,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-09-16 13:11:27,791 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int)) (or (forall ((v_ArrVal_600 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)))) is different from false [2022-09-16 13:11:27,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int) (v_ArrVal_599 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_599) |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296))) is different from false [2022-09-16 13:11:27,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_599) |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296))) is different from false [2022-09-16 13:11:27,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_599) |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)) 4294967296))) is different from false [2022-09-16 13:11:27,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_599) |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296))) is different from false [2022-09-16 13:11:27,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int) (v_ArrVal_599 (Array Int Int)) (v_ArrVal_598 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_598) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_599) |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)))) is different from false [2022-09-16 13:11:27,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:27,920 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:11:27,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:27,926 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 278 treesize of output 268 [2022-09-16 13:11:27,931 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 254 treesize of output 222 [2022-09-16 13:11:27,936 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 114 treesize of output 106 [2022-09-16 13:11:27,939 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 214 treesize of output 198 [2022-09-16 13:11:28,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-09-16 13:11:28,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127698412] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:28,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:28,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 64 [2022-09-16 13:11:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435822676] [2022-09-16 13:11:28,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:28,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-09-16 13:11:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:28,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-09-16 13:11:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=3022, Unknown=8, NotChecked=936, Total=4160 [2022-09-16 13:11:28,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:28,554 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:28,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 5.75) internal successors, (368), 65 states have internal predecessors, (368), 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:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:28,554 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:28,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:33,482 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (select .cse0 (+ 8 c_~X_0~0.offset)) 2147483647) (<= (select .cse0 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int)) (or (forall ((v_ArrVal_600 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:11:35,520 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= (select .cse0 (+ 8 c_~X_0~0.offset)) 2147483647) (<= (select .cse0 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_31| Int)) (or (forall ((v_ArrVal_600 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_31| v_ArrVal_600) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_31|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:35,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:35,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:11:35,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-09-16 13:11:36,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-09-16 13:11:36,097 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:36,097 INFO L85 PathProgramCache]: Analyzing trace with hash -267464075, now seen corresponding path program 1 times [2022-09-16 13:11:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:36,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438092061] [2022-09-16 13:11:36,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:36,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:36,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-09-16 13:11:36,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:36,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438092061] [2022-09-16 13:11:36,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438092061] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:11:36,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:11:36,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:11:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407518747] [2022-09-16 13:11:36,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:11:36,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 13:11:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:36,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 13:11:36,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 13:11:36,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,164 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:36,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 59.5) internal successors, (119), 3 states have internal predecessors, (119), 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:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:11:36,165 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:11:36,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-09-16 13:11:36,509 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:36,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash -267464074, now seen corresponding path program 1 times [2022-09-16 13:11:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:36,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658504968] [2022-09-16 13:11:36,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:36,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-09-16 13:11:36,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:36,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658504968] [2022-09-16 13:11:36,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658504968] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-16 13:11:36,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-16 13:11:36,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-16 13:11:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104124612] [2022-09-16 13:11:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-16 13:11:36,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-16 13:11:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:36,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-16 13:11:36,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-16 13:11:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:36,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 59.5) internal successors, (119), 3 states have internal predecessors, (119), 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:36,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,552 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 34 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:36,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-09-16 13:11:36,955 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:36,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:36,956 INFO L85 PathProgramCache]: Analyzing trace with hash -791305060, now seen corresponding path program 3 times [2022-09-16 13:11:36,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:36,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206734689] [2022-09-16 13:11:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:37,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:37,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206734689] [2022-09-16 13:11:37,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206734689] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:37,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071059134] [2022-09-16 13:11:37,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 13:11:37,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:37,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:37,106 INFO L229 MonitoredProcess]: Starting monitored process 14 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:37,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-09-16 13:11:37,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-09-16 13:11:37,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:11:37,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 18 conjunts are in the unsatisfiable core [2022-09-16 13:11:37,610 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:37,845 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:37,845 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:38,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071059134] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:38,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:38,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 35 [2022-09-16 13:11:38,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237949443] [2022-09-16 13:11:38,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:38,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-09-16 13:11:38,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:38,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-09-16 13:11:38,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=960, Unknown=0, NotChecked=0, Total=1190 [2022-09-16 13:11:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:38,103 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:38,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.914285714285715) internal successors, (242), 35 states have internal predecessors, (242), 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:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:38,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:38,105 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:39,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:39,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 13:11:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:39,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:11:39,554 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-09-16 13:11:39,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:39,739 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:11:39,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:11:39,740 INFO L85 PathProgramCache]: Analyzing trace with hash 221745669, now seen corresponding path program 1 times [2022-09-16 13:11:39,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:11:39,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28480047] [2022-09-16 13:11:39,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:39,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:11:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:40,232 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:40,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:11:40,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28480047] [2022-09-16 13:11:40,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28480047] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:11:40,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124901378] [2022-09-16 13:11:40,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:11:40,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:11:40,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:11:40,234 INFO L229 MonitoredProcess]: Starting monitored process 15 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:40,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-09-16 13:11:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:11:40,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 47 conjunts are in the unsatisfiable core [2022-09-16 13:11:40,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:11:40,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:11:41,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:41,024 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:41,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:41,074 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:41,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:41,220 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:41,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:11:41,318 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:41,349 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 21 treesize of output 9 [2022-09-16 13:11:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:11:41,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:11:41,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_742) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:11:41,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:11:41,429 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_741) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:11:41,436 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_741) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-09-16 13:11:41,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int)) (or (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) is different from false [2022-09-16 13:11:43,465 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int)) (or (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))))) is different from false [2022-09-16 13:11:43,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456)))) is different from false [2022-09-16 13:11:43,535 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)))))) is different from false [2022-09-16 13:11:43,564 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) is different from false [2022-09-16 13:11:43,580 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) is different from false [2022-09-16 13:11:43,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) is different from false [2022-09-16 13:11:43,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:43,645 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:11:43,653 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:11:43,653 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 1226 treesize of output 1204 [2022-09-16 13:11:43,661 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 1190 treesize of output 1126 [2022-09-16 13:11:43,669 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 1126 treesize of output 1094 [2022-09-16 13:11:43,676 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 1094 treesize of output 966 [2022-09-16 13:11:43,686 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 490 treesize of output 474 [2022-09-16 13:11:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-09-16 13:11:45,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124901378] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:11:45,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:11:45,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 68 [2022-09-16 13:11:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653224654] [2022-09-16 13:11:45,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:11:45,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-09-16 13:11:45,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:11:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-09-16 13:11:45,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=3068, Unknown=11, NotChecked=1342, Total=4692 [2022-09-16 13:11:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:45,564 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:11:45,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 4.882352941176471) internal successors, (332), 69 states have internal predecessors, (332), 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:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 13:11:45,564 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:45,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:11:45,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:11:45,565 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:11:47,778 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) (= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) is different from false [2022-09-16 13:11:47,782 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))))) is different from false [2022-09-16 13:11:47,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))))) is different from false [2022-09-16 13:11:47,787 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse1 8) 2147483648)) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ (select .cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|))) is different from false [2022-09-16 13:11:47,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 8) 2147483648)) (<= 0 (+ (select .cse1 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)) 2147483648)) (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))) (<= (+ |c_ULTIMATE.start_main_#t~ret27#1.base| 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 13:11:47,793 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 (+ 8 c_~X_0~0.offset)) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (forall ((v_ArrVal_739 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int) (v_ArrVal_740 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int) (v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)) (< 0 (+ 9223372039002259456 (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_739) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_740) |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)))))) (<= 0 (+ (select .cse1 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:11:49,907 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int)) (or (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))))) (<= 0 (+ (select .cse0 (+ 8 c_~X_0~0.offset)) 2147483648)) (< c_~X_0~0.base |c_#StackHeapBarrier|) (<= 0 (+ (select .cse0 8) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:13:23,988 WARN L233 SmtUtils]: Spent 14.02s on a formula simplification. DAG size of input: 40 DAG size of output: 16 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 13:13:25,991 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_35| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_35|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_35| Int)) (or (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_35| v_ArrVal_741) |v_thread1Thread1of1ForFork2_~#t3~0.base_35| v_ArrVal_742) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_35|)))))) (<= 0 (+ (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483648)) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:13:28,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:28,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:13:28,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:13:28,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-09-16 13:13:28,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:13:28,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:13:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:13:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash 372570786, now seen corresponding path program 1 times [2022-09-16 13:13:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:13:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656946866] [2022-09-16 13:13:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:13:28,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:13:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:13:28,962 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:13:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:13:28,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656946866] [2022-09-16 13:13:28,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656946866] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:13:28,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326497168] [2022-09-16 13:13:28,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:13:28,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:13:28,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:13:28,964 INFO L229 MonitoredProcess]: Starting monitored process 16 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:13:28,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-09-16 13:13:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:13:29,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 52 conjunts are in the unsatisfiable core [2022-09-16 13:13:29,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:13:29,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:13:29,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:13:29,810 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:13:29,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:13:29,866 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:13:30,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:13:30,003 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:13:30,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:13:30,067 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:13:30,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 13:13:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:13:30,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:13:30,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_796 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:13:30,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_795) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:13:30,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_795) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-09-16 13:13:30,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)))) is different from false [2022-09-16 13:13:32,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)))))) is different from false [2022-09-16 13:13:32,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) is different from false [2022-09-16 13:13:32,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) is different from false [2022-09-16 13:13:32,373 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) is different from false [2022-09-16 13:13:32,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) is different from false [2022-09-16 13:13:32,398 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-09-16 13:13:32,450 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:13:32,450 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 33 treesize of output 34 [2022-09-16 13:13:32,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:13:32,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 276 treesize of output 272 [2022-09-16 13:13:32,460 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 258 treesize of output 226 [2022-09-16 13:13:32,464 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 226 treesize of output 218 [2022-09-16 13:13:32,469 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 218 treesize of output 202 [2022-09-16 13:13:32,480 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 98 [2022-09-16 13:13:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-09-16 13:13:33,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326497168] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:13:33,140 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:13:33,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 66 [2022-09-16 13:13:33,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035230343] [2022-09-16 13:13:33,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:13:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-09-16 13:13:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:13:33,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-09-16 13:13:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=2925, Unknown=10, NotChecked=1190, Total=4422 [2022-09-16 13:13:33,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:13:33,142 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:13:33,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 5.015151515151516) internal successors, (331), 67 states have internal predecessors, (331), 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:13:33,142 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2022-09-16 13:13:33,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:13:34,786 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select .cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= (select .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|))) is different from false [2022-09-16 13:13:34,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= (select .cse1 (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (<= (select .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:13:34,792 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:13:34,795 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|))) is different from false [2022-09-16 13:13:34,797 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)) 2147483647) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 13:13:34,800 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int) (|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int) (v_ArrVal_793 (Array Int Int)) (v_ArrVal_795 (Array Int Int)) (v_ArrVal_794 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_793) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_794) |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)))) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:13:36,884 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (< c_~X_0~0.base |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)))))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:14:20,920 WARN L833 $PredicateComparison]: unable to prove that (and (<= (+ c_~X_0~0.base 1) |c_#StackHeapBarrier|) (<= (select (select |c_#memory_int| c_~X_0~0.base) 8) 2147483647) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_37|)) (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_37| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_37|)) (forall ((v_ArrVal_795 (Array Int Int)) (v_ArrVal_796 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_37| v_ArrVal_795) |v_thread1Thread1of1ForFork2_~#t3~0.base_37| v_ArrVal_796) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)))))) (= c_~X_0~0.offset 0)) is different from false [2022-09-16 13:14:23,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:14:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:23,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:23,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-09-16 13:14:23,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:23,676 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:14:23,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:14:23,676 INFO L85 PathProgramCache]: Analyzing trace with hash 17411948, now seen corresponding path program 4 times [2022-09-16 13:14:23,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:14:23,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626856031] [2022-09-16 13:14:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:14:23,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:14:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:14:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:24,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:14:24,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626856031] [2022-09-16 13:14:24,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626856031] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:14:24,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142769907] [2022-09-16 13:14:24,199 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 13:14:24,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:24,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:14:24,201 INFO L229 MonitoredProcess]: Starting monitored process 17 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:14:24,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-09-16 13:14:24,346 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 13:14:24,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:14:24,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 43 conjunts are in the unsatisfiable core [2022-09-16 13:14:24,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:14:24,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:14:24,811 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 13:14:24,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-09-16 13:14:24,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:24,995 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:14:25,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:25,119 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:14:25,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:25,150 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:14:25,192 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 21 treesize of output 9 [2022-09-16 13:14:25,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:25,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:14:25,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:14:25,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:14:25,259 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))) is different from false [2022-09-16 13:14:25,266 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (forall ((v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456))))) is different from false [2022-09-16 13:14:25,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 9223372039002259456)))) is different from false [2022-09-16 13:14:25,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 4)) 9223372039002259456)))) is different from false [2022-09-16 13:14:25,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int)) (or (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |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_thread1Thread1of1ForFork2_~#t2~0.base_39|)))) is different from false [2022-09-16 13:14:25,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-09-16 13:14:25,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int) (v_ArrVal_843 Int)) (or (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_843)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |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_thread1Thread1of1ForFork2_~#t2~0.base_39|)))) is different from false [2022-09-16 13:14:25,406 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| Int)) (or (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int) (v_ArrVal_843 Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_843)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |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_ULTIMATE.start_create_fresh_int_array_#t~post35#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68|)))) is different from false [2022-09-16 13:14:25,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int) (v_ArrVal_843 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_843)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-09-16 13:14:25,526 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:14:25,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-09-16 13:14:25,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:14:25,534 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:14:25,538 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 130 [2022-09-16 13:14:25,542 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 130 treesize of output 114 [2022-09-16 13:14:25,546 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 58 treesize of output 54 [2022-09-16 13:14:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2022-09-16 13:14:25,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142769907] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:14:25,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:14:25,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2022-09-16 13:14:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096882701] [2022-09-16 13:14:25,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:14:25,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-09-16 13:14:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:14:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-09-16 13:14:25,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=2322, Unknown=11, NotChecked=1188, Total=3782 [2022-09-16 13:14:25,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:25,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:14:25,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 5.0) internal successors, (305), 62 states have internal predecessors, (305), 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:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:25,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:25,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:27,108 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int) (v_ArrVal_843 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_843)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:14:27,111 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int) (v_ArrVal_843 Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_843)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) (= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 2147483648)) (= .cse1 4) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:14:29,114 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= 0 (+ (select .cse1 4) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 (+ 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= (div (+ (* (- 1) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 4) 4) |c_ULTIMATE.start_create_fresh_int_array_#t~post35#1|) (<= 1 |c_ULTIMATE.start_create_fresh_int_array_#t~post35#1|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| Int)) (or (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_847 (Array Int Int)) (v_ArrVal_846 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t2~0.base_39| Int) (v_ArrVal_843 Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_39|)) (< 0 (+ (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_843)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_845) |v_thread1Thread1of1ForFork2_~#t2~0.base_39| v_ArrVal_846) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_847) |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_ULTIMATE.start_create_fresh_int_array_#t~post35#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_68|)))) (<= (+ |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| 1) |c_#StackHeapBarrier|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) is different from false [2022-09-16 13:14:31,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:31,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:31,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:31,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-09-16 13:14:31,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-09-16 13:14:31,571 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:14:31,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:14:31,571 INFO L85 PathProgramCache]: Analyzing trace with hash 17411951, now seen corresponding path program 4 times [2022-09-16 13:14:31,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:14:31,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805162166] [2022-09-16 13:14:31,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:14:31,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:14:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:14:32,113 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:32,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:14:32,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805162166] [2022-09-16 13:14:32,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805162166] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:14:32,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216987477] [2022-09-16 13:14:32,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 13:14:32,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:32,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:14:32,115 INFO L229 MonitoredProcess]: Starting monitored process 18 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:14:32,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-09-16 13:14:32,266 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 13:14:32,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:14:32,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 47 conjunts are in the unsatisfiable core [2022-09-16 13:14:32,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:14:32,385 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:14:32,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:14:32,723 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 13:14:32,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-09-16 13:14:32,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:32,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:14:32,971 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:14:32,971 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:14:33,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:14:33,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:33,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-09-16 13:14:33,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-09-16 13:14:33,123 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:33,123 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:14:33,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_899) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:14:33,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_898) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_899) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:14:33,267 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_898 (Array Int Int)) (v_ArrVal_899 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_898) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_899) c_~X_0~0.base) (+ c_~X_0~0.offset 4)) 4294967296)) is different from false [2022-09-16 13:14:35,755 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:14:35,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-09-16 13:14:35,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:14:35,762 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 278 treesize of output 268 [2022-09-16 13:14:35,766 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 127 treesize of output 111 [2022-09-16 13:14:35,770 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 238 treesize of output 206 [2022-09-16 13:14:35,773 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 206 treesize of output 198 [2022-09-16 13:14:36,283 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:14:36,283 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 29 treesize of output 34 [2022-09-16 13:14:36,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:36,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216987477] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:14:36,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:14:36,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 61 [2022-09-16 13:14:36,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064182961] [2022-09-16 13:14:36,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:14:36,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-09-16 13:14:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:14:36,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-09-16 13:14:36,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3200, Unknown=28, NotChecked=348, Total=3782 [2022-09-16 13:14:36,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:36,467 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:14:36,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 5.0) internal successors, (305), 62 states have internal predecessors, (305), 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:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:36,468 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:36,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:36,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-09-16 13:14:36,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:36,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:36,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:36,469 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:44,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:14:44,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-09-16 13:14:45,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:45,083 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:14:45,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:14:45,084 INFO L85 PathProgramCache]: Analyzing trace with hash 173015620, now seen corresponding path program 4 times [2022-09-16 13:14:45,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:14:45,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535786500] [2022-09-16 13:14:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:14:45,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:14:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:14:45,687 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:45,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:14:45,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535786500] [2022-09-16 13:14:45,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535786500] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:14:45,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927120527] [2022-09-16 13:14:45,688 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-09-16 13:14:45,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:45,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:14:45,689 INFO L229 MonitoredProcess]: Starting monitored process 19 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:14:45,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-09-16 13:14:45,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-09-16 13:14:45,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:14:45,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 58 conjunts are in the unsatisfiable core [2022-09-16 13:14:45,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:14:45,893 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:14:45,916 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-09-16 13:14:45,916 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 14 [2022-09-16 13:14:46,049 INFO L356 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-09-16 13:14:46,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-09-16 13:14:46,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:14:46,692 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-09-16 13:14:46,692 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 1 case distinctions, treesize of input 27 treesize of output 26 [2022-09-16 13:14:46,936 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:14:47,008 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:14:47,077 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 13:14:47,077 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:14:47,157 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:14:47,227 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 21 treesize of output 9 [2022-09-16 13:14:47,229 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:47,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:14:47,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_957) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:14:47,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_957 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_957) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 9223372039002259456))) is different from false [2022-09-16 13:14:47,897 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:14:47,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 45 [2022-09-16 13:14:47,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:14:47,905 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 618 treesize of output 596 [2022-09-16 13:14:47,910 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 582 treesize of output 566 [2022-09-16 13:14:47,916 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 283 treesize of output 251 [2022-09-16 13:14:47,921 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 534 treesize of output 470 [2022-09-16 13:14:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:49,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927120527] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:14:49,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:14:49,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 72 [2022-09-16 13:14:49,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827008233] [2022-09-16 13:14:49,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:14:49,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-09-16 13:14:49,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:14:49,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-09-16 13:14:49,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=4597, Unknown=42, NotChecked=278, Total=5256 [2022-09-16 13:14:49,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:49,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:14:49,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 5.486111111111111) internal successors, (395), 73 states have internal predecessors, (395), 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:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:14:49,213 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:14:49,214 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:54,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:14:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 13:14:54,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-09-16 13:14:54,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:54,347 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:14:54,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:14:54,347 INFO L85 PathProgramCache]: Analyzing trace with hash 173015623, now seen corresponding path program 2 times [2022-09-16 13:14:54,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:14:54,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432565298] [2022-09-16 13:14:54,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:14:54,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:14:54,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:14:54,932 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:54,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:14:54,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432565298] [2022-09-16 13:14:54,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432565298] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:14:54,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521835974] [2022-09-16 13:14:54,933 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:14:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:14:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:14:54,934 INFO L229 MonitoredProcess]: Starting monitored process 20 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:14:54,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-09-16 13:14:55,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:14:55,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:14:55,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 53 conjunts are in the unsatisfiable core [2022-09-16 13:14:55,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:14:55,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-09-16 13:14:55,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:55,791 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 25 treesize of output 24 [2022-09-16 13:14:56,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:56,025 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:14:56,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:56,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-09-16 13:14:56,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:14:56,202 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:14:56,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 13:14:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:14:56,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:14:56,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1012) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:14:56,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1012 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1012) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) is different from false [2022-09-16 13:14:58,408 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int)) (or (forall ((v_ArrVal_1012 (Array Int Int))) (< (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 13:14:58,426 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 13:14:58,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) c_~X_0~0.base) (+ 8 c_~X_0~0.offset)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 13:14:58,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 8)) 4294967296))) is different from false [2022-09-16 13:14:58,534 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296))) is different from false [2022-09-16 13:14:58,540 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int))) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 13:14:58,571 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-09-16 13:14:58,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post35#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84|)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))))) is different from false [2022-09-16 13:14:58,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) is different from false [2022-09-16 13:14:58,638 INFO L356 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2022-09-16 13:14:58,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 43 [2022-09-16 13:14:58,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:14:58,657 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 1106 treesize of output 1060 [2022-09-16 13:14:58,665 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 1046 treesize of output 918 [2022-09-16 13:14:58,671 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 918 treesize of output 886 [2022-09-16 13:14:58,679 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 475 treesize of output 411 [2022-09-16 13:14:59,950 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 43 not checked. [2022-09-16 13:14:59,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521835974] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:14:59,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:14:59,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 70 [2022-09-16 13:14:59,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699294500] [2022-09-16 13:14:59,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:14:59,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-09-16 13:14:59,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:14:59,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-09-16 13:14:59,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3290, Unknown=11, NotChecked=1386, Total=4970 [2022-09-16 13:14:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:59,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:14:59,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 5.585714285714285) internal successors, (391), 71 states have internal predecessors, (391), 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:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:14:59,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:59,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:59,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:14:59,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:14:59,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:14:59,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-09-16 13:14:59,954 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:02,670 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483647) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) (= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (= (select |c_#valid| |c_ULTIMATE.start_main_~#t4~0#1.base|) 1)) is different from false [2022-09-16 13:15:02,673 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 2) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))) (= 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|)) is different from false [2022-09-16 13:15:04,677 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t4~0#1.base|) (<= (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483647) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| Int)) (or (not (<= (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post35#1| 1) |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84|)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_45| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (or (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* |v_ULTIMATE.start_create_fresh_int_array_~i~0#1_84| 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1010) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1011) |v_thread1Thread1of1ForFork2_~#t2~0.base_45| v_ArrVal_1012) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_45|)))))) (<= 2 |c_ULTIMATE.start_create_fresh_int_array_#t~post35#1|)) is different from false [2022-09-16 13:15:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:07,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:07,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:07,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-09-16 13:15:08,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:15:08,144 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:15:08,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:15:08,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2071678225, now seen corresponding path program 5 times [2022-09-16 13:15:08,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:15:08,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706622391] [2022-09-16 13:15:08,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:15:08,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:15:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:15:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:15:08,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706622391] [2022-09-16 13:15:08,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706622391] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:15:08,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234120505] [2022-09-16 13:15:08,715 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-09-16 13:15:08,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:15:08,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:15:08,716 INFO L229 MonitoredProcess]: Starting monitored process 21 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:15:08,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-09-16 13:15:08,897 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-09-16 13:15:08,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:15:08,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 51 conjunts are in the unsatisfiable core [2022-09-16 13:15:08,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:15:09,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:15:09,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:09,613 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:15:09,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:09,663 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:15:09,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:09,771 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:15:09,877 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 21 treesize of output 9 [2022-09-16 13:15:09,879 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:09,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:15:10,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1065 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:15:10,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1065 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) is different from false [2022-09-16 13:15:12,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (forall ((v_ArrVal_1065 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)))) is different from false [2022-09-16 13:15:12,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456)))) is different from false [2022-09-16 13:15:12,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456)))) is different from false [2022-09-16 13:15:12,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 12)) 9223372039002259456)))) is different from false [2022-09-16 13:15:12,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456)))) is different from false [2022-09-16 13:15:12,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))) is different from false [2022-09-16 13:15:12,138 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:12,138 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:15:12,144 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:12,144 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 310 treesize of output 300 [2022-09-16 13:15:12,148 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 286 treesize of output 270 [2022-09-16 13:15:12,151 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 270 treesize of output 238 [2022-09-16 13:15:12,156 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 114 [2022-09-16 13:15:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 22 not checked. [2022-09-16 13:15:12,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234120505] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:15:12,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:15:12,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 71 [2022-09-16 13:15:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327846302] [2022-09-16 13:15:12,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:15:12,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-09-16 13:15:12,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:15:12,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-09-16 13:15:12,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3781, Unknown=8, NotChecked=1048, Total=5112 [2022-09-16 13:15:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:12,984 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:15:12,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 5.014084507042254) internal successors, (356), 72 states have internal predecessors, (356), 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:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:12,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:12,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:12,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:12,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:17,469 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select .cse1 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (<= 0 (+ |c_ULTIMATE.start_create_fresh_int_array_#t~nondet36#1| 2147483648)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (<= 0 (+ (select .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))))) is different from false [2022-09-16 13:15:17,471 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select .cse1 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (<= 3 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (<= |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 3) (<= 0 (+ (select .cse1 (+ (* 4 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))))) is different from false [2022-09-16 13:15:17,474 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (<= 0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) 1) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| |c_#StackHeapBarrier|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 9223372039002259456)))))) is different from false [2022-09-16 13:15:17,477 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= 0 (+ (select .cse1 (+ 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 2147483648)) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) (<= 0 (+ (select .cse1 12) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| |c_#StackHeapBarrier|) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) 1) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 9223372039002259456)))))) is different from false [2022-09-16 13:15:17,479 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_#t~ret27#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~ret27#1.base|) 1) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (<= 0 (+ (select .cse1 12) 2147483648)) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (< |c_ULTIMATE.start_main_#t~ret27#1.base| |c_#StackHeapBarrier|) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 12)) 9223372039002259456)))) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| |c_ULTIMATE.start_main_#t~ret27#1.base|)) (<= 0 (+ (select .cse1 (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 12)) 2147483648)) (= |c_ULTIMATE.start_main_#t~ret27#1.offset| 0))) is different from false [2022-09-16 13:15:17,482 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1)) (.cse1 (select |c_#memory_int| c_~X_0~0.base))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse1 (+ c_~X_0~0.offset 12)) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int) (v_ArrVal_1065 (Array Int Int)) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)) (< 0 (+ (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1063) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1064) |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456)))) (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse1 12) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:15:19,616 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#t4~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t4~0#1.base| c_~X_0~0.base)) (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 12)) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (forall ((v_ArrVal_1065 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 12) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:15:21,654 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| c_~X_0~0.base))) (and (<= 0 (+ (select .cse0 (+ c_~X_0~0.offset 12)) 2147483648)) (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_47| Int)) (or (forall ((v_ArrVal_1065 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_47| v_ArrVal_1065) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_47|)))) (< c_~X_0~0.base |c_#StackHeapBarrier|) (= (select |c_#valid| c_~X_0~0.base) 1) (<= 0 (+ (select .cse0 12) 2147483648)) (= c_~X_0~0.offset 0))) is different from false [2022-09-16 13:15:22,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:22,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:22,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:22,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-09-16 13:15:22,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-09-16 13:15:22,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-09-16 13:15:22,533 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:15:22,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:15:22,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2071678222, now seen corresponding path program 3 times [2022-09-16 13:15:22,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:15:22,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495230323] [2022-09-16 13:15:22,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:15:22,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:15:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:15:23,107 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:23,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:15:23,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495230323] [2022-09-16 13:15:23,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495230323] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:15:23,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325960444] [2022-09-16 13:15:23,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-09-16 13:15:23,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:15:23,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:15:23,109 INFO L229 MonitoredProcess]: Starting monitored process 22 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:15:23,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-09-16 13:15:23,501 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-09-16 13:15:23,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:15:23,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 60 conjunts are in the unsatisfiable core [2022-09-16 13:15:23,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:15:23,512 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:15:23,695 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-09-16 13:15:23,695 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:15:24,246 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:15:24,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:24,698 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:15:24,787 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:15:24,887 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-09-16 13:15:24,887 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:15:25,051 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:15:25,232 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-09-16 13:15:25,233 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 10 [2022-09-16 13:15:25,235 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:25,235 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:15:26,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:26,318 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 33 treesize of output 34 [2022-09-16 13:15:26,326 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:26,326 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 650 treesize of output 620 [2022-09-16 13:15:26,334 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 301 treesize of output 273 [2022-09-16 13:15:26,339 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 574 treesize of output 462 [2022-09-16 13:15:26,350 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 462 treesize of output 406 [2022-09-16 13:15:29,205 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-09-16 13:15:29,205 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 22 treesize of output 18 [2022-09-16 13:15:29,314 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:29,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325960444] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:15:29,315 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:15:29,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 30] total 81 [2022-09-16 13:15:29,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007768190] [2022-09-16 13:15:29,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:15:29,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-09-16 13:15:29,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:15:29,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-09-16 13:15:29,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=6273, Unknown=42, NotChecked=0, Total=6642 [2022-09-16 13:15:29,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:29,317 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:15:29,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 4.592592592592593) internal successors, (372), 82 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-16 13:15:29,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:29,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:29,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:29,318 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:29,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:29,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:29,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:29,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2022-09-16 13:15:29,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:33,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:33,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-16 13:15:33,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-09-16 13:15:33,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-09-16 13:15:33,654 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:15:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:15:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash 2118850074, now seen corresponding path program 6 times [2022-09-16 13:15:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:15:33,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917115321] [2022-09-16 13:15:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:15:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:15:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:15:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 15 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:15:33,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917115321] [2022-09-16 13:15:33,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917115321] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:15:33,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098525946] [2022-09-16 13:15:33,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-09-16 13:15:33,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:15:33,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:15:33,829 INFO L229 MonitoredProcess]: Starting monitored process 23 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:15:33,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-09-16 13:15:34,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-09-16 13:15:34,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:15:34,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 21 conjunts are in the unsatisfiable core [2022-09-16 13:15:34,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:15:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:34,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:15:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:35,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098525946] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:15:35,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:15:35,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 43 [2022-09-16 13:15:35,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380384709] [2022-09-16 13:15:35,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:15:35,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-09-16 13:15:35,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:15:35,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-09-16 13:15:35,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1474, Unknown=0, NotChecked=0, Total=1806 [2022-09-16 13:15:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:35,054 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:15:35,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 6.441860465116279) internal successors, (277), 43 states have internal predecessors, (277), 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:15:35,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:35,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:35,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:35,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:35,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-16 13:15:35,055 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:37,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-16 13:15:37,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:15:37,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-09-16 13:15:37,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-09-16 13:15:37,567 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:15:37,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:15:37,567 INFO L85 PathProgramCache]: Analyzing trace with hash 242241607, now seen corresponding path program 2 times [2022-09-16 13:15:37,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:15:37,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858131640] [2022-09-16 13:15:37,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:15:37,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:15:37,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:15:38,177 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:38,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:15:38,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858131640] [2022-09-16 13:15:38,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858131640] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:15:38,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141900567] [2022-09-16 13:15:38,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-09-16 13:15:38,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:15:38,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:15:38,182 INFO L229 MonitoredProcess]: Starting monitored process 24 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:15:38,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-09-16 13:15:38,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-09-16 13:15:38,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-09-16 13:15:38,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 57 conjunts are in the unsatisfiable core [2022-09-16 13:15:38,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:15:38,500 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:15:38,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:15:39,245 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:39,246 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:15:39,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:39,309 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:15:39,362 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-09-16 13:15:39,362 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:15:39,476 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:15:39,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:15:39,662 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:15:39,697 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 21 treesize of output 9 [2022-09-16 13:15:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:15:39,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:15:39,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1227) c_~X_0~0.base) (+ c_~X_0~0.offset 4 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:15:39,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1227) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:15:39,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1227) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:15:39,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1226) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1227) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 9223372039002259456))) is different from false [2022-09-16 13:15:39,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1226) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1227) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) is different from false [2022-09-16 13:15:39,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_53| Int)) (or (forall ((v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1226 (Array Int Int))) (< 0 (+ (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1226) |v_thread1Thread1of1ForFork2_~#t3~0.base_53| v_ArrVal_1227) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 9223372039002259456))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_53|)))) is different from false [2022-09-16 13:15:40,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:40,335 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:15:40,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:40,341 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 614 treesize of output 604 [2022-09-16 13:15:40,346 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 590 treesize of output 526 [2022-09-16 13:15:40,351 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 526 treesize of output 510 [2022-09-16 13:15:40,357 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 258 treesize of output 250 [2022-09-16 13:15:40,362 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 502 treesize of output 470 [2022-09-16 13:15:41,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:15:41,647 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 29 treesize of output 34 [2022-09-16 13:15:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-09-16 13:15:41,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141900567] provided 0 perfect and 2 imperfect interpolant sequences [2022-09-16 13:15:41,841 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-09-16 13:15:41,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 77 [2022-09-16 13:15:41,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378875753] [2022-09-16 13:15:41,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-09-16 13:15:41,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-09-16 13:15:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-16 13:15:41,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-09-16 13:15:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=4820, Unknown=22, NotChecked=870, Total=6006 [2022-09-16 13:15:41,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:41,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-09-16 13:15:41,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 4.818181818181818) internal successors, (371), 78 states have internal predecessors, (371), 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:15:41,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:15:41,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:41,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:41,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:15:41,845 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:18:27,443 WARN L233 SmtUtils]: Spent 28.07s on a formula simplification. DAG size of input: 88 DAG size of output: 50 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-09-16 13:18:30,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-09-16 13:18:30,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-09-16 13:18:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:18:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-09-16 13:18:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-09-16 13:18:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-09-16 13:18:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-09-16 13:18:30,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-09-16 13:18:30,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-09-16 13:18:30,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:18:30,959 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-09-16 13:18:30,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-16 13:18:30,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1081703712, now seen corresponding path program 1 times [2022-09-16 13:18:30,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-16 13:18:30,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234453334] [2022-09-16 13:18:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:18:30,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-16 13:18:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:18:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:18:31,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-16 13:18:31,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234453334] [2022-09-16 13:18:31,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234453334] provided 0 perfect and 1 imperfect interpolant sequences [2022-09-16 13:18:31,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651662112] [2022-09-16 13:18:31,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-16 13:18:31,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:18:31,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-16 13:18:31,664 INFO L229 MonitoredProcess]: Starting monitored process 25 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:18:31,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-09-16 13:18:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-16 13:18:31,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 57 conjunts are in the unsatisfiable core [2022-09-16 13:18:31,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-09-16 13:18:32,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-09-16 13:18:32,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:18:32,709 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:18:32,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:18:32,769 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:18:32,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:18:32,940 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:18:33,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-09-16 13:18:33,062 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:18:33,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-09-16 13:18:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-16 13:18:33,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-09-16 13:18:33,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1285) c_~X_0~0.base) (+ 8 c_~X_0~0.offset (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:18:33,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:18:33,292 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1284) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12 (* 4 c_~i_3~0))) 4294967296)) is different from false [2022-09-16 13:18:33,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1284) |c_thread1Thread1of1ForFork2_~#t3~0.base| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296)) is different from false [2022-09-16 13:18:33,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_thread1Thread1of1ForFork2_~#t2~0.base| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296)))) is different from false [2022-09-16 13:18:35,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_55| Int)) (or (forall ((|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (forall ((v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |v_thread1Thread1of1ForFork2_~#t2~0.base_55| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296)))) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_55|)))) is different from false [2022-09-16 13:18:35,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_55| Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (< (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1283) |v_thread1Thread1of1ForFork2_~#t2~0.base_55| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_55|)))) is different from false [2022-09-16 13:18:35,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_55| Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1283) |v_thread1Thread1of1ForFork2_~#t2~0.base_55| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) c_~X_0~0.base) (+ c_~X_0~0.offset 12)) 4294967296) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_55|)))) is different from false [2022-09-16 13:18:35,424 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_55| Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_55|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1283) |v_thread1Thread1of1ForFork2_~#t2~0.base_55| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) |c_ULTIMATE.start_main_#t~ret27#1.base|) (+ |c_ULTIMATE.start_main_#t~ret27#1.offset| 12)) 4294967296))) is different from false [2022-09-16 13:18:35,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_55| Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_55|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1283) |v_thread1Thread1of1ForFork2_~#t2~0.base_55| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4294967296))) is different from false [2022-09-16 13:18:35,447 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_thread1Thread1of1ForFork2_~#t2~0.base_55| Int) (v_ArrVal_1285 (Array Int Int)) (v_ArrVal_1284 (Array Int Int)) (v_ArrVal_1283 (Array Int Int)) (v_ArrVal_1282 (Array Int Int)) (|v_thread1Thread1of1ForFork2_~#t3~0.base_55| Int)) (or (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t3~0.base_55|)) (not (< |c_#StackHeapBarrier| |v_thread1Thread1of1ForFork2_~#t2~0.base_55|)) (< (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1282) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1283) |v_thread1Thread1of1ForFork2_~#t2~0.base_55| v_ArrVal_1284) |v_thread1Thread1of1ForFork2_~#t3~0.base_55| v_ArrVal_1285) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ 12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4294967296))) is different from false [2022-09-16 13:18:35,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:18:35,503 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 33 treesize of output 34 [2022-09-16 13:18:35,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-09-16 13:18:35,511 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 2194 treesize of output 2148 [2022-09-16 13:18:35,522 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 1067 treesize of output 939 [2022-09-16 13:18:35,533 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 2006 treesize of output 1974 [2022-09-16 13:18:35,543 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 1974 treesize of output 1718 [2022-09-16 13:18:35,553 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 1718 treesize of output 1654 Received shutdown request... [2022-09-16 13:23:13,320 WARN L249 SmtUtils]: Removed 2 from assertion stack [2022-09-16 13:23:13,321 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-09-16 13:23:13,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-09-16 13:23:13,346 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:13,346 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:13,346 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-09-16 13:23:13,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-09-16 13:23:13,522 WARN L619 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-09-16 13:23:13,524 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-09-16 13:23:13,528 INFO L444 BasicCegarLoop]: Path program histogram: [6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-16 13:23:13,529 INFO L307 ceAbstractionStarter]: Result for error location thread2Thread1of1ForFork1 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/5) [2022-09-16 13:23:13,531 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-16 13:23:13,531 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-16 13:23:13,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 01:23:13 BasicIcfg [2022-09-16 13:23:13,533 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-16 13:23:13,533 INFO L158 Benchmark]: Toolchain (without parser) took 813128.99ms. Allocated memory was 187.7MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 155.0MB in the beginning and 607.1MB in the end (delta: -452.2MB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB. [2022-09-16 13:23:13,533 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-09-16 13:23:13,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.26ms. Allocated memory was 187.7MB in the beginning and 289.4MB in the end (delta: 101.7MB). Free memory was 155.0MB in the beginning and 255.2MB in the end (delta: -100.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-09-16 13:23:13,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.94ms. Allocated memory is still 289.4MB. Free memory was 255.2MB in the beginning and 252.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-16 13:23:13,534 INFO L158 Benchmark]: Boogie Preprocessor took 46.58ms. Allocated memory is still 289.4MB. Free memory was 252.5MB in the beginning and 250.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-16 13:23:13,534 INFO L158 Benchmark]: RCFGBuilder took 975.22ms. Allocated memory is still 289.4MB. Free memory was 250.4MB in the beginning and 172.8MB in the end (delta: 77.6MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. [2022-09-16 13:23:13,534 INFO L158 Benchmark]: TraceAbstraction took 811821.66ms. Allocated memory was 289.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 171.8MB in the beginning and 607.1MB in the end (delta: -435.3MB). Peak memory consumption was 958.6MB. Max. memory is 8.0GB. [2022-09-16 13:23:13,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 187.7MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.26ms. Allocated memory was 187.7MB in the beginning and 289.4MB in the end (delta: 101.7MB). Free memory was 155.0MB in the beginning and 255.2MB in the end (delta: -100.2MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.94ms. Allocated memory is still 289.4MB. Free memory was 255.2MB in the beginning and 252.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.58ms. Allocated memory is still 289.4MB. Free memory was 252.5MB in the beginning and 250.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 975.22ms. Allocated memory is still 289.4MB. Free memory was 250.4MB in the beginning and 172.8MB in the end (delta: 77.6MB). Peak memory consumption was 77.6MB. Max. memory is 8.0GB. * TraceAbstraction took 811821.66ms. Allocated memory was 289.4MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 171.8MB in the beginning and 607.1MB in the end (delta: -435.3MB). Peak memory consumption was 958.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2528531, positive: 2025881, positive conditional: 2019033, positive unconditional: 6848, negative: 502650, negative conditional: 502602, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2032167, positive: 2025881, positive conditional: 2019033, positive unconditional: 6848, negative: 6286, negative conditional: 6238, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2032167, positive: 2025881, positive conditional: 2019033, positive unconditional: 6848, negative: 6286, negative conditional: 6238, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2349601, positive: 2025881, positive conditional: 32607, positive unconditional: 1993274, negative: 323720, negative conditional: 284827, negative unconditional: 38893, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2349601, positive: 2025881, positive conditional: 32607, positive unconditional: 1993274, negative: 323720, negative conditional: 81962, negative unconditional: 241758, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2349601, positive: 2025881, positive conditional: 32607, positive unconditional: 1993274, negative: 323720, negative conditional: 81962, negative unconditional: 241758, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6909, positive: 5934, positive conditional: 153, positive unconditional: 5781, negative: 975, negative conditional: 920, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6909, positive: 5765, positive conditional: 0, positive unconditional: 5765, negative: 1144, negative conditional: 0, negative unconditional: 1144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1144, positive: 169, positive conditional: 153, positive unconditional: 16, negative: 974, negative conditional: 919, negative unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2947, positive: 455, positive conditional: 406, positive unconditional: 50, negative: 2490, negative conditional: 2222, negative unconditional: 267, unknown: 2, unknown conditional: 2, unknown unconditional: 0] ], Cache Queries: [ total: 2349601, positive: 2019947, positive conditional: 32454, positive unconditional: 1987493, negative: 322745, negative conditional: 81042, negative unconditional: 241703, unknown: 6909, unknown conditional: 1073, unknown unconditional: 5836] , Statistics on independence cache: Total cache size (in pairs): 6909, Positive cache size: 5934, Positive conditional cache size: 153, Positive unconditional cache size: 5781, Negative cache size: 975, Negative conditional cache size: 920, Negative unconditional cache size: 55, Eliminated conditions: 202865, Maximal queried relation: 28, Independence queries for same thread: 496364 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 1420, Number of trivial persistent sets: 557, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 6896, positive: 6848, positive conditional: 0, positive unconditional: 6848, negative: 48, negative conditional: 0, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2528531, positive: 2025881, positive conditional: 2019033, positive unconditional: 6848, negative: 502650, negative conditional: 502602, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2032167, positive: 2025881, positive conditional: 2019033, positive unconditional: 6848, negative: 6286, negative conditional: 6238, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2032167, positive: 2025881, positive conditional: 2019033, positive unconditional: 6848, negative: 6286, negative conditional: 6238, negative unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2349601, positive: 2025881, positive conditional: 32607, positive unconditional: 1993274, negative: 323720, negative conditional: 284827, negative unconditional: 38893, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2349601, positive: 2025881, positive conditional: 32607, positive unconditional: 1993274, negative: 323720, negative conditional: 81962, negative unconditional: 241758, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2349601, positive: 2025881, positive conditional: 32607, positive unconditional: 1993274, negative: 323720, negative conditional: 81962, negative unconditional: 241758, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 6909, positive: 5934, positive conditional: 153, positive unconditional: 5781, negative: 975, negative conditional: 920, negative unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 6909, positive: 5765, positive conditional: 0, positive unconditional: 5765, negative: 1144, negative conditional: 0, negative unconditional: 1144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 1144, positive: 169, positive conditional: 153, positive unconditional: 16, negative: 974, negative conditional: 919, negative unconditional: 55, unknown: 1, unknown conditional: 1, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2947, positive: 455, positive conditional: 406, positive unconditional: 50, negative: 2490, negative conditional: 2222, negative unconditional: 267, unknown: 2, unknown conditional: 2, unknown unconditional: 0] ], Cache Queries: [ total: 2349601, positive: 2019947, positive conditional: 32454, positive unconditional: 1987493, negative: 322745, negative conditional: 81042, negative unconditional: 241703, unknown: 6909, unknown conditional: 1073, unknown unconditional: 5836] , Statistics on independence cache: Total cache size (in pairs): 6909, Positive cache size: 5934, Positive conditional cache size: 153, Positive unconditional cache size: 5781, Negative cache size: 975, Negative conditional cache size: 920, Negative unconditional cache size: 55, Eliminated conditions: 202865, Maximal queried relation: 28, Independence queries for same thread: 496364 - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 162]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - TimeoutResultAtElement [Line: 163]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PartialOrderCegarLoop was analyzing trace of length 159 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 1ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread2Thread1of1ForFork1 with 1 thread instances CFG has 9 procedures, 298 locations, 58 error locations. Started 1 CEGAR loops. OverallTime: 811.6s, OverallIterations: 30, TraceHistogramMax: 0, PathProgramHistogramMax: 6, EmptinessCheckTime: 443.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 824, 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.5s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 75.3s InterpolantComputationTime, 6856 NumberOfCodeBlocks, 6856 NumberOfCodeBlocksAsserted, 80 NumberOfCheckSat, 9789 ConstructedInterpolants, 1070 QuantifiedInterpolants, 120382 SizeOfPredicates, 476 NumberOfNonLiveVariables, 7741 ConjunctsInSsa, 921 ConjunctsInUnsatCore, 73 InterpolantComputations, 7 PerfectInterpolantSequences, 248/2445 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