/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_THREAD_INSTANCE -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/goblint-regression/28-race_reach_72-funloop_hard_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-9868fc6-m [2022-11-14 19:47:58,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-14 19:47:58,639 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-14 19:47:58,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-14 19:47:58,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-14 19:47:58,670 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-14 19:47:58,675 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-14 19:47:58,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-14 19:47:58,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-14 19:47:58,683 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-14 19:47:58,684 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-14 19:47:58,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-14 19:47:58,684 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-14 19:47:58,685 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-14 19:47:58,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-14 19:47:58,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-14 19:47:58,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-14 19:47:58,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-14 19:47:58,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-14 19:47:58,689 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-14 19:47:58,690 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-14 19:47:58,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-14 19:47:58,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-14 19:47:58,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-14 19:47:58,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-14 19:47:58,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-14 19:47:58,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-14 19:47:58,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-14 19:47:58,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-14 19:47:58,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-14 19:47:58,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-14 19:47:58,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-14 19:47:58,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-14 19:47:58,712 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-14 19:47:58,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-14 19:47:58,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-14 19:47:58,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-14 19:47:58,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-14 19:47:58,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-14 19:47:58,713 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-14 19:47:58,714 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-14 19:47:58,715 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/NewStatesSleepPersistentFixedOrder.epf [2022-11-14 19:47:58,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-14 19:47:58,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-14 19:47:58,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-14 19:47:58,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-14 19:47:58,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-14 19:47:58,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-14 19:47:58,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-14 19:47:58,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-14 19:47:58,741 INFO L138 SettingsManager]: * Use SBE=true [2022-11-14 19:47:58,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-14 19:47:58,742 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-14 19:47:58,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-14 19:47:58,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-14 19:47:58,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-14 19:47:58,743 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-14 19:47:58,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:47:58,744 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2022-11-14 19:47:58,744 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2022-11-14 19:47:58,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_THREAD_INSTANCE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.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-11-14 19:47:58,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-14 19:47:58,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-14 19:47:58,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-14 19:47:58,932 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-14 19:47:58,933 INFO L275 PluginConnector]: CDTParser initialized [2022-11-14 19:47:58,934 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-14 19:47:58,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4aa7651/6a09481a212d4086ab6c555f7d70b481/FLAGa5208b093 [2022-11-14 19:47:59,433 INFO L306 CDTParser]: Found 1 translation units. [2022-11-14 19:47:59,433 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i [2022-11-14 19:47:59,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4aa7651/6a09481a212d4086ab6c555f7d70b481/FLAGa5208b093 [2022-11-14 19:47:59,812 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0b4aa7651/6a09481a212d4086ab6c555f7d70b481 [2022-11-14 19:47:59,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-14 19:47:59,815 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-11-14 19:47:59,816 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-14 19:47:59,816 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-14 19:47:59,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-14 19:47:59,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:47:59" (1/1) ... [2022-11-14 19:47:59,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2963efdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:47:59, skipping insertion in model container [2022-11-14 19:47:59,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:47:59" (1/1) ... [2022-11-14 19:47:59,825 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-14 19:47:59,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-14 19:48:00,328 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-14 19:48:00,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:48:00,366 INFO L203 MainTranslator]: Completed pre-run [2022-11-14 19:48:00,400 WARN L233 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_72-funloop_hard_racing.i[41323,41336] [2022-11-14 19:48:00,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-14 19:48:00,446 INFO L208 MainTranslator]: Completed translation [2022-11-14 19:48:00,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00 WrapperNode [2022-11-14 19:48:00,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-14 19:48:00,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-14 19:48:00,447 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-14 19:48:00,447 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-14 19:48:00,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,516 INFO L138 Inliner]: procedures = 271, calls = 41, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 269 [2022-11-14 19:48:00,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-14 19:48:00,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-14 19:48:00,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-14 19:48:00,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-14 19:48:00,524 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,524 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,557 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-14 19:48:00,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-14 19:48:00,561 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-14 19:48:00,561 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-14 19:48:00,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (1/1) ... [2022-11-14 19:48:00,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-14 19:48:00,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:00,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-14 19:48:00,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2022-11-14 19:48:00,625 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2022-11-14 19:48:00,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-14 19:48:00,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-14 19:48:00,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-14 19:48:00,627 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-14 19:48:00,721 INFO L235 CfgBuilder]: Building ICFG [2022-11-14 19:48:00,723 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-14 19:48:00,993 INFO L276 CfgBuilder]: Performing block encoding [2022-11-14 19:48:01,000 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-14 19:48:01,001 INFO L300 CfgBuilder]: Removed 35 assume(true) statements. [2022-11-14 19:48:01,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:48:01 BoogieIcfgContainer [2022-11-14 19:48:01,002 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-14 19:48:01,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-14 19:48:01,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-14 19:48:01,006 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-14 19:48:01,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:47:59" (1/3) ... [2022-11-14 19:48:01,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3c041d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:48:01, skipping insertion in model container [2022-11-14 19:48:01,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:48:00" (2/3) ... [2022-11-14 19:48:01,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d3c041d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:48:01, skipping insertion in model container [2022-11-14 19:48:01,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:48:01" (3/3) ... [2022-11-14 19:48:01,008 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_72-funloop_hard_racing.i [2022-11-14 19:48:01,013 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-14 19:48:01,020 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-14 19:48:01,020 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-11-14 19:48:01,020 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-14 19:48:01,110 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2022-11-14 19:48:01,143 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:48:01,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-11-14 19:48:01,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:01,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2022-11-14 19:48:01,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2022-11-14 19:48:01,180 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2022-11-14 19:48:01,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2022-11-14 19:48:01,193 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;@763f65da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-14 19:48:01,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-14 19:48:01,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:01,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:01,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1999583012, now seen corresponding path program 1 times [2022-11-14 19:48:01,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:01,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17797466] [2022-11-14 19:48:01,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:01,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:01,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:01,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:01,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17797466] [2022-11-14 19:48:01,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17797466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:01,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:48:01,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-14 19:48:01,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155190774] [2022-11-14 19:48:01,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:01,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-14 19:48:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:01,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-14 19:48:01,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-14 19:48:01,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,650 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:01,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:01,651 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-14 19:48:01,676 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:01,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:01,677 INFO L85 PathProgramCache]: Analyzing trace with hash 2040647739, now seen corresponding path program 1 times [2022-11-14 19:48:01,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:01,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078230862] [2022-11-14 19:48:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:01,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:01,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:01,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:01,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:01,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078230862] [2022-11-14 19:48:01,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078230862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:01,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:48:01,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:48:01,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885089894] [2022-11-14 19:48:01,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:01,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-14 19:48:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:01,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-14 19:48:01,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-14 19:48:01,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,835 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:01,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,835 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:01,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:01,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-14 19:48:01,881 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:01,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:01,882 INFO L85 PathProgramCache]: Analyzing trace with hash -980841847, now seen corresponding path program 1 times [2022-11-14 19:48:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:01,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965397159] [2022-11-14 19:48:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:01,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:02,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:02,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:02,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965397159] [2022-11-14 19:48:02,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965397159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:02,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484593688] [2022-11-14 19:48:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:02,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:02,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:02,009 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:02,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-14 19:48:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:02,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-14 19:48:02,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:02,202 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:48:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:02,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484593688] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:48:02,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:48:02,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-14 19:48:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177433039] [2022-11-14 19:48:02,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:48:02,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-14 19:48:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:02,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-14 19:48:02,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-14 19:48:02,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:02,253 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:02,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 10 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:02,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:02,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:02,254 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:02,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:02,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-14 19:48:02,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-14 19:48:02,563 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:02,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1867721143, now seen corresponding path program 2 times [2022-11-14 19:48:02,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:02,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588835188] [2022-11-14 19:48:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:02,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:02,734 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:02,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:02,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588835188] [2022-11-14 19:48:02,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588835188] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:02,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281871227] [2022-11-14 19:48:02,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:48:02,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:02,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:02,745 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:02,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-14 19:48:02,813 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-14 19:48:02,813 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:48:02,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-14 19:48:02,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:02,854 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-14 19:48:03,023 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:48:03,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:48:03,062 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-14 19:48:03,136 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 10 [2022-11-14 19:48:03,160 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-14 19:48:03,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:48:03,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281871227] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:03,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:48:03,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 18 [2022-11-14 19:48:03,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014846688] [2022-11-14 19:48:03,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:03,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-14 19:48:03,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:03,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-14 19:48:03,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2022-11-14 19:48:03,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,162 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:03,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:03,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:03,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:03,163 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:03,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:03,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-14 19:48:03,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:03,479 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:03,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2064779729, now seen corresponding path program 1 times [2022-11-14 19:48:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:03,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064318616] [2022-11-14 19:48:03,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:03,577 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:03,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064318616] [2022-11-14 19:48:03,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064318616] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:03,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274234255] [2022-11-14 19:48:03,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:03,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:03,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:03,579 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:03,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-14 19:48:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:03,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-14 19:48:03,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:03,711 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:03,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:48:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:03,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274234255] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:48:03,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:48:03,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-11-14 19:48:03,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091604648] [2022-11-14 19:48:03,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:48:03,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-14 19:48:03,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-14 19:48:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-11-14 19:48:03,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:03,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.722222222222222) internal successors, (103), 18 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:03,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:03,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:03,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:03,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:03,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-14 19:48:04,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:04,131 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:04,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1012334255, now seen corresponding path program 2 times [2022-11-14 19:48:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:04,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688498006] [2022-11-14 19:48:04,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:04,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:04,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:04,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688498006] [2022-11-14 19:48:04,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688498006] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:04,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567907023] [2022-11-14 19:48:04,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:48:04,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:04,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:04,413 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:04,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-14 19:48:04,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-14 19:48:04,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:48:04,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-14 19:48:04,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:04,526 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-14 19:48:04,792 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:48:04,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:48:04,847 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-14 19:48:04,915 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 10 [2022-11-14 19:48:04,951 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2022-11-14 19:48:04,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:48:04,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567907023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:04,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:48:04,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 26 [2022-11-14 19:48:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975552205] [2022-11-14 19:48:04,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:04,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-14 19:48:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-14 19:48:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-11-14 19:48:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:04,953 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:04,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 11 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:04,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:05,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:05,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-14 19:48:05,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:05,323 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:05,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:05,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1487027237, now seen corresponding path program 1 times [2022-11-14 19:48:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:05,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319107442] [2022-11-14 19:48:05,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:05,532 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:05,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319107442] [2022-11-14 19:48:05,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319107442] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780370718] [2022-11-14 19:48:05,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:05,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:05,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:05,534 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:05,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-14 19:48:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:05,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-14 19:48:05,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:05,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:48:05,883 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-14 19:48:05,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780370718] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:48:05,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:48:05,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2022-11-14 19:48:05,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572787846] [2022-11-14 19:48:05,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:48:05,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-14 19:48:05,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:05,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-14 19:48:05,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-11-14 19:48:05,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:05,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:05,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.826086956521739) internal successors, (134), 23 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:05,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:05,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:05,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:05,885 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:05,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:05,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:05,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:06,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-14 19:48:06,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:06,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:06,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:06,312 INFO L85 PathProgramCache]: Analyzing trace with hash 404394217, now seen corresponding path program 2 times [2022-11-14 19:48:06,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:06,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346248870] [2022-11-14 19:48:06,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:06,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:06,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346248870] [2022-11-14 19:48:06,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346248870] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:06,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:48:06,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-14 19:48:06,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038583055] [2022-11-14 19:48:06,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:06,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-14 19:48:06,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:06,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-14 19:48:06,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-14 19:48:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,520 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:06,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.8) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:06,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:06,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:06,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:06,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:06,521 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-14 19:48:06,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-14 19:48:06,559 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:06,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:06,560 INFO L85 PathProgramCache]: Analyzing trace with hash -348680299, now seen corresponding path program 1 times [2022-11-14 19:48:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:06,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66330410] [2022-11-14 19:48:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:06,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66330410] [2022-11-14 19:48:06,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66330410] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:06,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:48:06,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-14 19:48:06,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64962685] [2022-11-14 19:48:06,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:06,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-14 19:48:06,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:06,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-14 19:48:06,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-14 19:48:06,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,985 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:06,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.384615384615385) internal successors, (70), 14 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2022-11-14 19:48:06,985 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:07,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:07,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-14 19:48:07,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:07,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1554218159, now seen corresponding path program 1 times [2022-11-14 19:48:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698707317] [2022-11-14 19:48:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:07,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:07,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698707317] [2022-11-14 19:48:07,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698707317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:07,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:48:07,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:48:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648352328] [2022-11-14 19:48:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:07,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:48:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:48:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:48:07,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:07,278 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:07,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 27.0) internal successors, (81), 4 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:07,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:07,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:07,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-14 19:48:07,335 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:07,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1584131277, now seen corresponding path program 1 times [2022-11-14 19:48:07,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:07,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507586911] [2022-11-14 19:48:07,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:07,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:08,783 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:08,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507586911] [2022-11-14 19:48:08,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507586911] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:08,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231226973] [2022-11-14 19:48:08,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:08,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:08,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:08,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:08,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-14 19:48:08,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:08,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-14 19:48:08,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:08,946 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-14 19:48:09,299 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:48:09,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:48:09,341 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-14 19:48:09,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2022-11-14 19:48:09,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2022-11-14 19:48:09,813 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 10 [2022-11-14 19:48:09,861 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-14 19:48:09,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:48:10,880 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 7 [2022-11-14 19:48:10,913 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-14 19:48:10,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-14 19:48:10,916 INFO L134 CoverageAnalysis]: Checked inductivity of 341 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2022-11-14 19:48:10,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231226973] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:48:10,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:48:10,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 15] total 46 [2022-11-14 19:48:10,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206451202] [2022-11-14 19:48:10,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:48:10,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-14 19:48:10,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:10,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-14 19:48:10,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1943, Unknown=5, NotChecked=0, Total=2162 [2022-11-14 19:48:10,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:10,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:10,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 6.065217391304348) internal successors, (279), 47 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:10,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:12,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-14 19:48:12,855 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-11-14 19:48:12,856 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:12,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:12,856 INFO L85 PathProgramCache]: Analyzing trace with hash 253955737, now seen corresponding path program 1 times [2022-11-14 19:48:12,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:12,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714664949] [2022-11-14 19:48:12,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:12,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 326 trivial. 0 not checked. [2022-11-14 19:48:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:12,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714664949] [2022-11-14 19:48:12,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714664949] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:12,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-14 19:48:12,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-14 19:48:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015359356] [2022-11-14 19:48:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:12,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-14 19:48:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:12,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-14 19:48:12,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-14 19:48:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:12,925 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:12,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 41.0) internal successors, (123), 4 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:12,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:12,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:12,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-14 19:48:12,949 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:12,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:12,949 INFO L85 PathProgramCache]: Analyzing trace with hash -717305905, now seen corresponding path program 1 times [2022-11-14 19:48:12,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:12,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346119819] [2022-11-14 19:48:12,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:12,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:13,069 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:13,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:13,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346119819] [2022-11-14 19:48:13,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346119819] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:13,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820958564] [2022-11-14 19:48:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:13,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:13,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:13,071 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:13,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-14 19:48:13,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:13,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-14 19:48:13,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:13,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:48:13,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820958564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:13,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:48:13,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-14 19:48:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334384230] [2022-11-14 19:48:13,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:13,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-14 19:48:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-14 19:48:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-14 19:48:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:13,263 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:13,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.8) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:13,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:13,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:13,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:13,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:13,264 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:13,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:13,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:13,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-14 19:48:13,699 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,SelfDestructingSolverStorable12 [2022-11-14 19:48:13,702 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:13,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:13,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1802725048, now seen corresponding path program 1 times [2022-11-14 19:48:13,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:13,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881192273] [2022-11-14 19:48:13,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:13,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:13,843 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2022-11-14 19:48:13,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:13,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881192273] [2022-11-14 19:48:13,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881192273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:13,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955732338] [2022-11-14 19:48:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:13,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:13,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:13,845 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:13,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-14 19:48:13,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:13,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 689 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-14 19:48:13,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:14,008 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2022-11-14 19:48:14,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-14 19:48:14,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955732338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-14 19:48:14,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-14 19:48:14,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-11-14 19:48:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71654212] [2022-11-14 19:48:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-14 19:48:14,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-14 19:48:14,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:14,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-14 19:48:14,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-14 19:48:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:14,009 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:14,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:14,010 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:14,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:14,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:14,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-14 19:48:14,457 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,SelfDestructingSolverStorable13 [2022-11-14 19:48:14,458 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:14,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash -906128999, now seen corresponding path program 1 times [2022-11-14 19:48:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:14,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344704794] [2022-11-14 19:48:14,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:14,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:14,606 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2022-11-14 19:48:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:14,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344704794] [2022-11-14 19:48:14,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344704794] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:14,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413568695] [2022-11-14 19:48:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:14,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:14,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:14,608 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:14,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-14 19:48:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:14,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-14 19:48:14,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2022-11-14 19:48:14,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:48:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 215 proven. 1 refuted. 0 times theorem prover too weak. 470 trivial. 0 not checked. [2022-11-14 19:48:14,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413568695] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:48:14,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:48:14,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-11-14 19:48:14,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509834035] [2022-11-14 19:48:14,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:48:14,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-14 19:48:14,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:48:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-14 19:48:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-14 19:48:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:14,957 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:48:14,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.0) internal successors, (270), 10 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:48:14,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:14,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:14,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:14,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:14,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:14,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:15,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:48:15,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-14 19:48:15,137 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-11-14 19:48:15,326 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,SelfDestructingSolverStorable14 [2022-11-14 19:48:15,327 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:48:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:48:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 2090006455, now seen corresponding path program 1 times [2022-11-14 19:48:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:48:15,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372153206] [2022-11-14 19:48:15,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:48:15,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:48:25,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:48:25,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372153206] [2022-11-14 19:48:25,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372153206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:48:25,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111703743] [2022-11-14 19:48:25,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:48:25,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:48:25,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:48:25,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-14 19:48:25,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-14 19:48:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:48:25,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-14 19:48:25,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:48:25,706 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-14 19:48:26,032 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-14 19:48:26,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-14 19:48:26,085 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-14 19:48:26,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-14 19:48:26,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-14 19:48:31,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-14 19:48:34,610 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 21 [2022-11-14 19:48:37,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-14 19:49:17,585 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 16 [2022-11-14 19:49:17,722 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:49:17,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:49:18,297 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1142))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-14 19:49:18,421 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1140)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1142))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-14 19:49:18,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-14 19:49:18,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2022-11-14 19:49:18,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_38| Int)) (or (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ .cse0 28 |c_~#cache~0.offset|))))) (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_38|)))) is different from false [2022-11-14 19:49:18,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2022-11-14 19:49:18,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1138 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1138)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647)))) is different from false [2022-11-14 19:49:19,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1138 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1138)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))))) is different from false [2022-11-14 19:49:19,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1138 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|)) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1138) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28)))) is different from false [2022-11-14 19:49:19,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| Int) (v_ArrVal_1140 Int) (v_ArrVal_1142 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| Int) (v_ArrVal_1134 (Array Int Int)) (v_ArrVal_1138 Int) (v_ArrVal_1141 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53|)) (< (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1134))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_53| v_ArrVal_1138) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1140))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1141) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| v_ArrVal_1142) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_51| 28)))) is different from false [2022-11-14 19:49:20,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:49:20,392 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:49:20,394 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 25 [2022-11-14 19:49:20,396 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:49:20,398 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 51 [2022-11-14 19:49:20,455 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-14 19:49:20,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-14 19:49:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 78 not checked. [2022-11-14 19:49:20,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111703743] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:49:20,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:49:20,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 67 [2022-11-14 19:49:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293555522] [2022-11-14 19:49:20,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:49:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-14 19:49:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:49:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-14 19:49:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=2974, Unknown=39, NotChecked=1210, Total=4556 [2022-11-14 19:49:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:49:20,462 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:49:20,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 6.597014925373134) internal successors, (442), 68 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-14 19:49:20,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:52:09,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-14 19:52:09,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:52:09,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-14 19:52:09,634 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,SelfDestructingSolverStorable15 [2022-11-14 19:52:09,634 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-14 19:52:09,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-14 19:52:09,634 INFO L85 PathProgramCache]: Analyzing trace with hash -420204077, now seen corresponding path program 2 times [2022-11-14 19:52:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-14 19:52:09,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447892206] [2022-11-14 19:52:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-14 19:52:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-14 19:52:09,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-14 19:53:22,698 WARN L233 SmtUtils]: Spent 7.38s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:53:41,441 WARN L233 SmtUtils]: Spent 7.58s on a formula simplification that was a NOOP. DAG size: 92 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:54:01,066 WARN L233 SmtUtils]: Spent 7.12s on a formula simplification that was a NOOP. DAG size: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:54:15,856 WARN L233 SmtUtils]: Spent 5.47s on a formula simplification that was a NOOP. DAG size: 99 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:54:19,254 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:54:19,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-14 19:54:19,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447892206] [2022-11-14 19:54:19,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447892206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-14 19:54:19,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508776662] [2022-11-14 19:54:19,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-14 19:54:19,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-14 19:54:19,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-11-14 19:54:19,257 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-11-14 19:54:19,259 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-11-14 19:54:19,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-14 19:54:19,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-14 19:54:19,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-14 19:54:19,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-14 19:54:20,199 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 6 [2022-11-14 19:54:20,838 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-14 19:54:20,839 INFO L350 Elim1Store]: Elim1 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-11-14 19:54:21,039 INFO L350 Elim1Store]: Elim1 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 13 treesize of output 15 [2022-11-14 19:54:21,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-14 19:54:21,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-14 19:54:29,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2022-11-14 19:54:32,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-14 19:55:11,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2022-11-14 19:55:20,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2022-11-14 19:56:14,031 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2022-11-14 19:56:16,441 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 19 [2022-11-14 19:56:17,065 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-11-14 19:56:17,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-14 19:56:17,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483647)) is different from false [2022-11-14 19:56:18,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int)) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2022-11-14 19:56:19,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2022-11-14 19:56:19,547 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_43| Int)) (or (not (<= (+ |c_t_funThread1of1ForFork0_#t~post41#1| 1) |v_t_funThread1of1ForFork0_~i~0#1_43|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (or (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse0 28 |c_~#cache~0.offset|))))))) is different from false [2022-11-14 19:56:19,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (or (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2022-11-14 19:56:19,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1310)))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647)))) is different from false [2022-11-14 19:56:19,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (or (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse1 28 |c_~#cache~0.offset|))))) is different from false [2022-11-14 19:56:19,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))) is different from false [2022-11-14 19:56:20,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_#t~post41#1| 2)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse1 28 |c_~#cache~0.offset|)) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) is different from false [2022-11-14 19:56:20,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse1 28 |c_~#cache~0.offset|)) (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) is different from false [2022-11-14 19:56:20,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse0 (+ .cse1 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse1 28 |c_~#cache~0.offset|)) (< (select (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1307)))) (store .cse2 |c_~#cache~0.base| (store (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) is different from false [2022-11-14 19:56:20,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse0 (+ .cse2 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< .cse0 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1307)))) (store .cse1 |c_~#cache~0.base| (store (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2022-11-14 19:56:20,614 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (or (< (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| 28)))) is different from false [2022-11-14 19:56:20,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)) (< (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1303))) (store .cse0 |c_~#cache~0.base| (store (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| 84)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| 28)))) is different from false [2022-11-14 19:56:22,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:56:22,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:56:22,672 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-14 19:56:22,674 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 22 [2022-11-14 19:56:22,682 INFO L350 Elim1Store]: Elim1 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-11-14 19:56:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 325 trivial. 173 not checked. [2022-11-14 19:56:23,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508776662] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-14 19:56:23,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-14 19:56:23,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 26] total 86 [2022-11-14 19:56:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973698423] [2022-11-14 19:56:23,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-14 19:56:23,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-11-14 19:56:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-14 19:56:23,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-11-14 19:56:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=4881, Unknown=90, NotChecked=2170, Total=7482 [2022-11-14 19:56:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:56:23,047 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-11-14 19:56:23,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 6.674418604651163) internal successors, (574), 87 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-11-14 19:56:23,048 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-11-14 19:57:53,540 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse49 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse18 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse85 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse49 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse71 (@diff .cse85 .cse0)) (.cse16 (@diff .cse18 .cse0))) (let ((.cse97 (store .cse18 .cse16 0)) (.cse87 (store .cse85 .cse71 0))) (let ((.cse74 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse70 (@diff .cse87 .cse0)) (.cse7 (@diff .cse97 .cse0))) (let ((.cse98 (store .cse97 .cse7 0)) (.cse88 (store .cse87 .cse70 0)) (.cse101 (@diff .cse74 .cse0))) (let ((.cse100 (store .cse74 .cse101 0)) (.cse68 (@diff .cse88 .cse0)) (.cse8 (@diff .cse98 .cse0))) (let ((.cse96 (store .cse98 .cse8 0)) (.cse90 (store .cse88 .cse68 0)) (.cse99 (@diff .cse100 .cse0))) (let ((.cse81 (store .cse74 .cse49 0)) (.cse84 (store .cse100 .cse99 0)) (.cse66 (@diff .cse90 .cse0)) (.cse13 (@diff .cse96 .cse0))) (let ((.cse94 (store .cse96 .cse13 0)) (.cse89 (store .cse90 .cse66 0)) (.cse93 (@diff .cse84 .cse0)) (.cse80 (@diff .cse81 .cse0))) (let ((.cse83 (store .cse81 .cse80 0)) (.cse92 (store .cse84 .cse93 0)) (.cse67 (@diff .cse89 .cse0)) (.cse3 (@diff .cse94 .cse0))) (let ((.cse95 (store .cse94 .cse3 0)) (.cse86 (store .cse89 .cse67 0)) (.cse91 (@diff .cse92 .cse0)) (.cse82 (@diff .cse83 .cse0))) (let ((.cse79 (store .cse83 .cse82 0)) (.cse17 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse55 (= .cse0 .cse74)) (.cse54 (+ .cse101 28)) (.cse59 (= .cse0 .cse100)) (.cse58 (+ .cse99 28)) (.cse4 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse63 (store .cse92 .cse91 0)) (.cse69 (@diff .cse86 .cse0)) (.cse15 (= .cse0 .cse18)) (.cse9 (= .cse0 .cse98)) (.cse6 (= .cse0 .cse97)) (.cse36 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse14 (= .cse0 .cse96)) (.cse12 (@diff .cse95 .cse0))) (let ((.cse11 (= .cse0 .cse95)) (.cse10 (= .cse0 (store .cse95 .cse12 0))) (.cse37 (or (<= .cse13 .cse36) .cse14)) (.cse5 (= .cse0 .cse94)) (.cse38 (or .cse6 (<= .cse7 .cse36))) (.cse39 (or (<= .cse8 .cse36) .cse9)) (.cse40 (or (<= .cse16 .cse36) .cse15)) (.cse34 (+ 28 .cse69)) (.cse28 (+ 28 .cse67)) (.cse24 (+ .cse68 28)) (.cse33 (+ .cse70 28)) (.cse30 (+ .cse66 28)) (.cse25 (+ .cse71 28)) (.cse50 (= .cse0 .cse63)) (.cse61 (+ .cse93 28)) (.cse52 (= .cse92 .cse0)) (.cse53 (+ .cse91 28)) (.cse29 (= .cse0 .cse90)) (.cse27 (= .cse0 .cse89)) (.cse23 (= .cse0 .cse88)) (.cse35 (= .cse0 .cse86)) (.cse32 (= .cse0 .cse87)) (.cse31 (= .cse0 (store .cse86 .cse69 0))) (.cse26 (= .cse85 .cse0)) (.cse19 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse62 (= .cse84 .cse0)) (.cse64 (or .cse59 (<= .cse58 .cse4))) (.cse65 (or .cse55 (<= .cse54 .cse4))) (.cse1 (not .cse17)) (.cse22 (= .cse0 .cse79)) (.cse20 (or (<= (+ .cse82 28) .cse4) (= .cse83 .cse0))) (.cse21 (or (<= (+ .cse80 28) .cse4) (= .cse0 .cse81))) (.cse2 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse60 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) (select |c_#memory_int| 3)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))) (or .cse1 .cse2) (or (and (or (<= (+ .cse3 28) .cse4) .cse5) (or .cse6 (<= (+ .cse7 28) .cse4)) (or (<= (+ .cse8 28) .cse4) .cse9) .cse10 (or .cse11 (<= (+ .cse12 28) .cse4)) (or (<= (+ .cse13 28) .cse4) .cse14) (or .cse15 (<= (+ 28 .cse16) .cse4))) .cse17) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse4) (= .cse18 (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1307)))) .cse19 (or (and .cse19 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse20 .cse21 .cse2 .cse22) .cse1) (or (and (or .cse23 (<= .cse24 .cse4)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= .cse25 .cse4) .cse26) (or .cse27 (<= .cse28 .cse4)) (or .cse29 (<= .cse30 .cse4)) .cse2 .cse31 (or .cse32 (<= .cse33 .cse4)) (or (<= .cse34 .cse4) .cse35)) .cse1) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse4) (or (and .cse19 .cse15) .cse17) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) .cse15 (or (and (or .cse11 (<= .cse12 .cse36)) (or .cse5 (<= .cse3 .cse36)) .cse37 .cse10 .cse38 .cse39 .cse40) .cse17) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse4) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse4) (= (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1310) .cse18))) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse4) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse4) (= (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse18) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse4))) (or .cse1 (let ((.cse42 (store .cse18 .cse49 0))) (let ((.cse41 (@diff .cse42 .cse0))) (let ((.cse45 (store .cse42 .cse41 0))) (let ((.cse46 (@diff .cse45 .cse0))) (let ((.cse43 (store .cse45 .cse46 0))) (let ((.cse44 (@diff .cse43 .cse0))) (let ((.cse47 (store .cse43 .cse44 0))) (let ((.cse48 (@diff .cse47 .cse0))) (and (or (<= .cse41 .cse36) (= .cse0 .cse42)) (or (= .cse0 .cse43) (<= .cse44 .cse36)) (or (= .cse0 .cse45) (<= .cse46 .cse36)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse0 (store .cse47 .cse48 0)) (or (<= .cse48 .cse36) (= .cse0 .cse47)) .cse2)))))))))) (= |c_~#cache~0.offset| 0) (or .cse1 (and .cse19 .cse26 .cse2)) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse37 .cse5 .cse38 .cse39 .cse40) .cse17) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse51 (@diff .cse63 .cse0))) (let ((.cse57 (store .cse63 .cse51 0))) (let ((.cse56 (@diff .cse57 .cse0))) (and (or .cse50 (<= (+ .cse51 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse52 (<= .cse53 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse54 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse55) (or (<= (+ .cse56 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse0 .cse57)) (or (<= .cse58 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse59) (= .cse0 (store .cse57 .cse56 0)) (not .cse60) (or (<= .cse61 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse62))))) (and (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (or (<= .cse34 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse35) (or .cse27 (<= .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse23 (<= .cse24 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse32 (<= .cse33 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse29 (<= .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse25 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse26) .cse2 .cse31 .cse60)) (or (and .cse19 .cse50 .cse64 .cse65 (or (<= .cse61 .cse4) .cse62) (or .cse52 (<= .cse53 .cse4))) .cse17) (or .cse1 (and (or .cse29 (<= .cse66 .cse36)) (or (<= .cse67 .cse36) .cse27) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse23 (<= .cse68 .cse36)) (or .cse35 (<= .cse69 .cse36)) (or (<= .cse70 .cse36) .cse32) .cse2 .cse31 (or (<= .cse71 .cse36) .cse26))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (let ((.cse75 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse72 (+ .cse75 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse72 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< .cse72 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< (select (select (store (let ((.cse73 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse74 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1307)))) (store .cse73 |c_~#cache~0.base| (store (store (select .cse73 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse75 28 |c_~#cache~0.offset|)))))) (= |c_~#cache~0.base| 3) (or (and .cse19 .cse62 .cse64 .cse65) .cse17) (or .cse1 (let ((.cse76 (@diff .cse79 .cse0))) (let ((.cse78 (store .cse79 .cse76 0))) (let ((.cse77 (@diff .cse78 .cse0))) (and (or .cse22 (<= (+ .cse76 28) .cse4)) .cse20 .cse21 (or (<= (+ .cse77 28) .cse4) (= .cse0 .cse78)) (= .cse0 (store .cse78 .cse77 0)) .cse2 .cse60 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))))))))))))) is different from true [2022-11-14 19:58:08,021 WARN L233 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 231 DAG size of output: 79 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:58:40,831 WARN L233 SmtUtils]: Spent 23.23s on a formula simplification. DAG size of input: 324 DAG size of output: 60 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 19:58:51,983 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse29 (@diff .cse84 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse102 (store .cse26 .cse20 0)) (.cse86 (store .cse84 .cse29 0))) (let ((.cse37 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse37 0))) (let ((.cse28 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse28 0))) (let ((.cse34 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse34 0))) (let ((.cse32 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse32 0))) (let ((.cse38 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse33 (= .cse22 .cse89)) (.cse31 (= .cse22 .cse88)) (.cse27 (= .cse22 .cse87)) (.cse39 (= .cse22 .cse85)) (.cse36 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse35 (= .cse22 (store .cse85 .cse38 0))) (.cse30 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (or (and (or .cse27 (<= (+ .cse28 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse29 28) .cse8) .cse30) (or .cse31 (<= (+ 28 .cse32) .cse8)) (or .cse33 (<= (+ .cse34 28) .cse8)) .cse1 .cse35 (or .cse36 (<= (+ .cse37 28) .cse8)) (or (<= (+ 28 .cse38) .cse8) .cse39)) .cse0) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1315)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse51 (store .cse26 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (or .cse0 (and (or .cse33 (<= .cse34 .cse45)) (or (<= .cse32 .cse45) .cse31) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse27 (<= .cse28 .cse45)) (or .cse39 (<= .cse38 .cse45)) (or (<= .cse37 .cse45) .cse36) .cse1 .cse35 (or (<= .cse29 .cse45) .cse30))) (forall ((v_ArrVal_1316 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483647)) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-14 19:58:54,214 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse62 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse88 (store .cse99 .cse62 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse33 (@diff .cse88 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse105 (store .cse26 .cse20 0)) (.cse90 (store .cse88 .cse33 0))) (let ((.cse41 (@diff .cse90 .cse22)) (.cse11 (@diff .cse105 .cse22))) (let ((.cse106 (store .cse105 .cse11 0)) (.cse91 (store .cse90 .cse41 0))) (let ((.cse32 (@diff .cse91 .cse22)) (.cse12 (@diff .cse106 .cse22))) (let ((.cse104 (store .cse106 .cse12 0)) (.cse30 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse93 (store .cse91 .cse32 0))) (let ((.cse38 (@diff .cse93 .cse22)) (.cse103 (store .cse30 .cse62 0)) (.cse17 (@diff .cse104 .cse22))) (let ((.cse100 (@diff .cse30 .cse22)) (.cse94 (store .cse104 .cse17 0)) (.cse97 (@diff .cse103 .cse22)) (.cse92 (store .cse93 .cse38 0))) (let ((.cse36 (@diff .cse92 .cse22)) (.cse95 (store .cse103 .cse97 0)) (.cse7 (@diff .cse94 .cse22)) (.cse101 (store .cse30 .cse100 0))) (let ((.cse102 (@diff .cse101 .cse22)) (.cse98 (store .cse94 .cse7 0)) (.cse96 (@diff .cse95 .cse22)) (.cse89 (store .cse92 .cse36 0))) (let ((.cse42 (@diff .cse89 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse106)) (.cse10 (= .cse22 .cse105)) (.cse49 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse104)) (.cse44 (= .cse22 .cse103)) (.cse70 (store .cse95 .cse96 0)) (.cse16 (@diff .cse98 .cse22)) (.cse45 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse87 (= .cse22 .cse30)) (.cse25 (store .cse101 .cse102 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse101) (<= (+ .cse102 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse100 28) .cse8) .cse87)) (.cse46 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse47 (= (select .cse99 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse48 (and (not .cse45) (= (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse98)) (.cse14 (= .cse22 (store .cse98 .cse16 0))) (.cse63 (= .cse22 .cse70)) (.cse67 (or .cse44 (<= (+ 28 .cse97) .cse8))) (.cse68 (or (= .cse22 .cse95) (<= (+ 28 .cse96) .cse8))) (.cse50 (or (<= .cse17 .cse49) .cse18)) (.cse9 (= .cse22 .cse94)) (.cse51 (or .cse10 (<= .cse11 .cse49))) (.cse52 (or (<= .cse12 .cse49) .cse13)) (.cse53 (or (<= .cse20 .cse49) .cse19)) (.cse69 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse79 (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse37 (= .cse22 .cse93)) (.cse35 (= .cse22 .cse92)) (.cse31 (= .cse22 .cse91)) (.cse43 (= .cse22 .cse89)) (.cse40 (= .cse22 .cse90)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse39 (= .cse22 (store .cse89 .cse42 0))) (.cse34 (= .cse88 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (let ((.cse28 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse27 (+ .cse28 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse27 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< .cse27 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse28 28 |c_~#cache~0.offset|)) (< (select (select (store (let ((.cse29 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1307)))) (store .cse29 |c_~#cache~0.base| (store (store (select .cse29 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) (or (and (or .cse31 (<= (+ .cse32 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse33 28) .cse8) .cse34) (or .cse35 (<= (+ 28 .cse36) .cse8)) (or .cse37 (<= (+ .cse38 28) .cse8)) .cse1 .cse39 (or .cse40 (<= (+ .cse41 28) .cse8)) (or (<= (+ 28 .cse42) .cse8) .cse43)) .cse0) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1315)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse44 .cse1 .cse45)) (or (and .cse46 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse45 .cse47) .cse48) (or (and .cse46 .cse1 .cse45 .cse47) .cse48) .cse19 (or (and (or .cse15 (<= .cse16 .cse49)) (or .cse9 (<= .cse7 .cse49)) .cse50 .cse14 .cse51 .cse52 .cse53) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse55 (store .cse26 .cse62 0))) (let ((.cse54 (@diff .cse55 .cse22))) (let ((.cse58 (store .cse55 .cse54 0))) (let ((.cse59 (@diff .cse58 .cse22))) (let ((.cse56 (store .cse58 .cse59 0))) (let ((.cse57 (@diff .cse56 .cse22))) (let ((.cse60 (store .cse56 .cse57 0))) (let ((.cse61 (@diff .cse60 .cse22))) (and (or (<= .cse54 .cse49) (= .cse22 .cse55)) (or (= .cse22 .cse56) (<= .cse57 .cse49)) (or (= .cse22 .cse58) (<= .cse59 .cse49)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse60 .cse61 0)) (or (<= .cse61 .cse49) (= .cse22 .cse60)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse64 (@diff .cse70 .cse22))) (let ((.cse66 (store .cse70 .cse64 0))) (let ((.cse65 (@diff .cse66 .cse22))) (and (or .cse63 (<= (+ .cse64 28) .cse8)) (or (<= (+ .cse65 28) .cse8) (= .cse22 .cse66)) .cse67 .cse68 (= .cse22 (store .cse66 .cse65 0)) .cse1 .cse45 .cse69))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse63 .cse67 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse68 .cse1) .cse0) (or (and .cse50 .cse9 .cse51 .cse52 .cse53) .cse6) (or .cse0 (let ((.cse77 (store .cse79 .cse62 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse71 (store .cse77 .cse78 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse75 (store .cse71 .cse72 0))) (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse73 (store .cse75 .cse76 0))) (let ((.cse74 (@diff .cse73 .cse22))) (and (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (= .cse22 (store .cse73 .cse74 0)) (or (= .cse22 .cse75) (<= (+ .cse76 28) .cse8)) (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse74) .cse8) (= .cse22 .cse73)) .cse1 .cse45 .cse69)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse80 (@diff .cse79 .cse22))) (let ((.cse86 (store .cse79 .cse80 0))) (let ((.cse85 (@diff .cse86 .cse22))) (let ((.cse81 (store .cse86 .cse85 0))) (let ((.cse82 (@diff .cse81 .cse22))) (let ((.cse84 (store .cse81 .cse82 0))) (let ((.cse83 (@diff .cse84 .cse22))) (and (or (<= (+ .cse80 28) .cse8) (= .cse22 .cse79)) .cse3 (or (= .cse22 .cse81) (<= (+ .cse82 28) .cse8)) (or (<= (+ 28 .cse83) .cse8) (= .cse22 .cse84)) (= .cse22 (store .cse84 .cse83 0)) (or (<= (+ 28 .cse85) .cse8) (= .cse22 .cse86)))))))))) .cse6) (or .cse0 (and (or .cse37 (<= .cse38 .cse49)) (or (<= .cse36 .cse49) .cse35) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse31 (<= .cse32 .cse49)) (or .cse43 (<= .cse42 .cse49)) (or (<= .cse41 .cse49) .cse40) .cse1 .cse39 (or (<= .cse33 .cse49) .cse34))) (forall ((v_ArrVal_1316 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483647)) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse87) .cse6)))))))))))))))) is different from true [2022-11-14 19:58:56,487 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse29 (@diff .cse84 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse102 (store .cse26 .cse20 0)) (.cse86 (store .cse84 .cse29 0))) (let ((.cse37 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse37 0))) (let ((.cse28 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse28 0))) (let ((.cse34 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse34 0))) (let ((.cse32 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse32 0))) (let ((.cse38 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse33 (= .cse22 .cse89)) (.cse31 (= .cse22 .cse88)) (.cse27 (= .cse22 .cse87)) (.cse39 (= .cse22 .cse85)) (.cse36 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse35 (= .cse22 (store .cse85 .cse38 0))) (.cse30 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (or (and (or .cse27 (<= (+ .cse28 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse29 28) .cse8) .cse30) (or .cse31 (<= (+ 28 .cse32) .cse8)) (or .cse33 (<= (+ .cse34 28) .cse8)) .cse1 .cse35 (or .cse36 (<= (+ .cse37 28) .cse8)) (or (<= (+ 28 .cse38) .cse8) .cse39)) .cse0) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (= (select |c_#memory_int| 3) (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_58| v_ArrVal_1315)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse51 (store .cse26 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (or .cse0 (and (or .cse33 (<= .cse34 .cse45)) (or (<= .cse32 .cse45) .cse31) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse27 (<= .cse28 .cse45)) (or .cse39 (<= .cse38 .cse45)) (or (<= .cse37 .cse45) .cse36) .cse1 .cse35 (or (<= .cse29 .cse45) .cse30))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-14 19:59:11,273 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse62 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse88 (store .cse99 .cse62 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse33 (@diff .cse88 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse105 (store .cse26 .cse20 0)) (.cse90 (store .cse88 .cse33 0))) (let ((.cse41 (@diff .cse90 .cse22)) (.cse11 (@diff .cse105 .cse22))) (let ((.cse106 (store .cse105 .cse11 0)) (.cse91 (store .cse90 .cse41 0))) (let ((.cse32 (@diff .cse91 .cse22)) (.cse12 (@diff .cse106 .cse22))) (let ((.cse104 (store .cse106 .cse12 0)) (.cse30 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse93 (store .cse91 .cse32 0))) (let ((.cse38 (@diff .cse93 .cse22)) (.cse103 (store .cse30 .cse62 0)) (.cse17 (@diff .cse104 .cse22))) (let ((.cse100 (@diff .cse30 .cse22)) (.cse94 (store .cse104 .cse17 0)) (.cse97 (@diff .cse103 .cse22)) (.cse92 (store .cse93 .cse38 0))) (let ((.cse36 (@diff .cse92 .cse22)) (.cse95 (store .cse103 .cse97 0)) (.cse7 (@diff .cse94 .cse22)) (.cse101 (store .cse30 .cse100 0))) (let ((.cse102 (@diff .cse101 .cse22)) (.cse98 (store .cse94 .cse7 0)) (.cse96 (@diff .cse95 .cse22)) (.cse89 (store .cse92 .cse36 0))) (let ((.cse42 (@diff .cse89 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse106)) (.cse10 (= .cse22 .cse105)) (.cse49 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse104)) (.cse44 (= .cse22 .cse103)) (.cse70 (store .cse95 .cse96 0)) (.cse16 (@diff .cse98 .cse22)) (.cse45 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse87 (= .cse22 .cse30)) (.cse25 (store .cse101 .cse102 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse101) (<= (+ .cse102 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse100 28) .cse8) .cse87)) (.cse46 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse47 (= (select .cse99 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse48 (and (not .cse45) (= (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse98)) (.cse14 (= .cse22 (store .cse98 .cse16 0))) (.cse63 (= .cse22 .cse70)) (.cse67 (or .cse44 (<= (+ 28 .cse97) .cse8))) (.cse68 (or (= .cse22 .cse95) (<= (+ 28 .cse96) .cse8))) (.cse50 (or (<= .cse17 .cse49) .cse18)) (.cse9 (= .cse22 .cse94)) (.cse51 (or .cse10 (<= .cse11 .cse49))) (.cse52 (or (<= .cse12 .cse49) .cse13)) (.cse53 (or (<= .cse20 .cse49) .cse19)) (.cse69 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse79 (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse37 (= .cse22 .cse93)) (.cse35 (= .cse22 .cse92)) (.cse31 (= .cse22 .cse91)) (.cse43 (= .cse22 .cse89)) (.cse40 (= .cse22 .cse90)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse39 (= .cse22 (store .cse89 .cse42 0))) (.cse34 (= .cse88 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (let ((.cse28 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse27 (+ .cse28 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse27 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< .cse27 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse28 28 |c_~#cache~0.offset|)) (< (select (select (store (let ((.cse29 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1307)))) (store .cse29 |c_~#cache~0.base| (store (store (select .cse29 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) (or (and (or .cse31 (<= (+ .cse32 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse33 28) .cse8) .cse34) (or .cse35 (<= (+ 28 .cse36) .cse8)) (or .cse37 (<= (+ .cse38 28) .cse8)) .cse1 .cse39 (or .cse40 (<= (+ .cse41 28) .cse8)) (or (<= (+ 28 .cse42) .cse8) .cse43)) .cse0) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse44 .cse1 .cse45)) (or (and .cse46 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse45 .cse47) .cse48) (or (and .cse46 .cse1 .cse45 .cse47) .cse48) .cse19 (or (and (or .cse15 (<= .cse16 .cse49)) (or .cse9 (<= .cse7 .cse49)) .cse50 .cse14 .cse51 .cse52 .cse53) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse55 (store .cse26 .cse62 0))) (let ((.cse54 (@diff .cse55 .cse22))) (let ((.cse58 (store .cse55 .cse54 0))) (let ((.cse59 (@diff .cse58 .cse22))) (let ((.cse56 (store .cse58 .cse59 0))) (let ((.cse57 (@diff .cse56 .cse22))) (let ((.cse60 (store .cse56 .cse57 0))) (let ((.cse61 (@diff .cse60 .cse22))) (and (or (<= .cse54 .cse49) (= .cse22 .cse55)) (or (= .cse22 .cse56) (<= .cse57 .cse49)) (or (= .cse22 .cse58) (<= .cse59 .cse49)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse60 .cse61 0)) (or (<= .cse61 .cse49) (= .cse22 .cse60)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 0) (or .cse0 (let ((.cse64 (@diff .cse70 .cse22))) (let ((.cse66 (store .cse70 .cse64 0))) (let ((.cse65 (@diff .cse66 .cse22))) (and (or .cse63 (<= (+ .cse64 28) .cse8)) (or (<= (+ .cse65 28) .cse8) (= .cse22 .cse66)) .cse67 .cse68 (= .cse22 (store .cse66 .cse65 0)) .cse1 .cse45 .cse69))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse63 .cse67 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse68 .cse1) .cse0) (or (and .cse50 .cse9 .cse51 .cse52 .cse53) .cse6) (or .cse0 (let ((.cse77 (store .cse79 .cse62 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse71 (store .cse77 .cse78 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse75 (store .cse71 .cse72 0))) (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse73 (store .cse75 .cse76 0))) (let ((.cse74 (@diff .cse73 .cse22))) (and (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (= .cse22 (store .cse73 .cse74 0)) (or (= .cse22 .cse75) (<= (+ .cse76 28) .cse8)) (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse74) .cse8) (= .cse22 .cse73)) .cse1 .cse45 .cse69)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 0) (or (let ((.cse80 (@diff .cse79 .cse22))) (let ((.cse86 (store .cse79 .cse80 0))) (let ((.cse85 (@diff .cse86 .cse22))) (let ((.cse81 (store .cse86 .cse85 0))) (let ((.cse82 (@diff .cse81 .cse22))) (let ((.cse84 (store .cse81 .cse82 0))) (let ((.cse83 (@diff .cse84 .cse22))) (and (or (<= (+ .cse80 28) .cse8) (= .cse22 .cse79)) .cse3 (or (= .cse22 .cse81) (<= (+ .cse82 28) .cse8)) (or (<= (+ 28 .cse83) .cse8) (= .cse22 .cse84)) (= .cse22 (store .cse84 .cse83 0)) (or (<= (+ 28 .cse85) .cse8) (= .cse22 .cse86)))))))))) .cse6) (or .cse0 (and (or .cse37 (<= .cse38 .cse49)) (or (<= .cse36 .cse49) .cse35) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse31 (<= .cse32 .cse49)) (or .cse43 (<= .cse42 .cse49)) (or (<= .cse41 .cse49) .cse40) .cse1 .cse39 (or (<= .cse33 .cse49) .cse34))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse87) .cse6)))))))))))))))) is different from true [2022-11-14 19:59:13,390 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse29 (@diff .cse84 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse102 (store .cse26 .cse20 0)) (.cse86 (store .cse84 .cse29 0))) (let ((.cse37 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse37 0))) (let ((.cse28 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse28 0))) (let ((.cse34 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse34 0))) (let ((.cse32 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse32 0))) (let ((.cse38 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse33 (= .cse22 .cse89)) (.cse31 (= .cse22 .cse88)) (.cse27 (= .cse22 .cse87)) (.cse39 (= .cse22 .cse85)) (.cse36 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse35 (= .cse22 (store .cse85 .cse38 0))) (.cse30 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (or (and (or .cse27 (<= (+ .cse28 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse29 28) .cse8) .cse30) (or .cse31 (<= (+ 28 .cse32) .cse8)) (or .cse33 (<= (+ .cse34 28) .cse8)) .cse1 .cse35 (or .cse36 (<= (+ .cse37 28) .cse8)) (or (<= (+ 28 .cse38) .cse8) .cse39)) .cse0) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse51 (store .cse26 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~mem34#1| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (or .cse0 (and (or .cse33 (<= .cse34 .cse45)) (or (<= .cse32 .cse45) .cse31) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse27 (<= .cse28 .cse45)) (or .cse39 (<= .cse38 .cse45)) (or (<= .cse37 .cse45) .cse36) .cse1 .cse35 (or (<= .cse29 .cse45) .cse30))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-14 19:59:28,278 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse96 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse58 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse84 (store .cse96 .cse58 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse29 (@diff .cse84 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse102 (store .cse26 .cse20 0)) (.cse86 (store .cse84 .cse29 0))) (let ((.cse37 (@diff .cse86 .cse22)) (.cse11 (@diff .cse102 .cse22))) (let ((.cse103 (store .cse102 .cse11 0)) (.cse87 (store .cse86 .cse37 0))) (let ((.cse28 (@diff .cse87 .cse22)) (.cse12 (@diff .cse103 .cse22))) (let ((.cse101 (store .cse103 .cse12 0)) (.cse90 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse89 (store .cse87 .cse28 0))) (let ((.cse34 (@diff .cse89 .cse22)) (.cse100 (store .cse90 .cse58 0)) (.cse17 (@diff .cse101 .cse22))) (let ((.cse97 (@diff .cse90 .cse22)) (.cse91 (store .cse101 .cse17 0)) (.cse94 (@diff .cse100 .cse22)) (.cse88 (store .cse89 .cse34 0))) (let ((.cse32 (@diff .cse88 .cse22)) (.cse92 (store .cse100 .cse94 0)) (.cse7 (@diff .cse91 .cse22)) (.cse98 (store .cse90 .cse97 0))) (let ((.cse99 (@diff .cse98 .cse22)) (.cse95 (store .cse91 .cse7 0)) (.cse93 (@diff .cse92 .cse22)) (.cse85 (store .cse88 .cse32 0))) (let ((.cse38 (@diff .cse85 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse103)) (.cse10 (= .cse22 .cse102)) (.cse45 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse101)) (.cse40 (= .cse22 .cse100)) (.cse66 (store .cse92 .cse93 0)) (.cse16 (@diff .cse95 .cse22)) (.cse41 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse83 (= .cse22 .cse90)) (.cse25 (store .cse98 .cse99 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse98) (<= (+ .cse99 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse97 28) .cse8) .cse83)) (.cse42 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse43 (= (select .cse96 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse44 (and (not .cse41) (= (select .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse95)) (.cse14 (= .cse22 (store .cse95 .cse16 0))) (.cse59 (= .cse22 .cse66)) (.cse63 (or .cse40 (<= (+ 28 .cse94) .cse8))) (.cse64 (or (= .cse22 .cse92) (<= (+ 28 .cse93) .cse8))) (.cse46 (or (<= .cse17 .cse45) .cse18)) (.cse9 (= .cse22 .cse91)) (.cse47 (or .cse10 (<= .cse11 .cse45))) (.cse48 (or (<= .cse12 .cse45) .cse13)) (.cse49 (or (<= .cse20 .cse45) .cse19)) (.cse65 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse75 (store .cse90 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse33 (= .cse22 .cse89)) (.cse31 (= .cse22 .cse88)) (.cse27 (= .cse22 .cse87)) (.cse39 (= .cse22 .cse85)) (.cse36 (= .cse22 .cse86)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse35 (= .cse22 (store .cse85 .cse38 0))) (.cse30 (= .cse84 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (or (and (or .cse27 (<= (+ .cse28 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse29 28) .cse8) .cse30) (or .cse31 (<= (+ 28 .cse32) .cse8)) (or .cse33 (<= (+ .cse34 28) .cse8)) .cse1 .cse35 (or .cse36 (<= (+ .cse37 28) .cse8)) (or (<= (+ 28 .cse38) .cse8) .cse39)) .cse0) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse40 .cse1 .cse41)) (or (and .cse42 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse41 .cse43) .cse44) (or (and .cse42 .cse1 .cse41 .cse43) .cse44) .cse19 (or (and (or .cse15 (<= .cse16 .cse45)) (or .cse9 (<= .cse7 .cse45)) .cse46 .cse14 .cse47 .cse48 .cse49) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse51 (store .cse26 .cse58 0))) (let ((.cse50 (@diff .cse51 .cse22))) (let ((.cse54 (store .cse51 .cse50 0))) (let ((.cse55 (@diff .cse54 .cse22))) (let ((.cse52 (store .cse54 .cse55 0))) (let ((.cse53 (@diff .cse52 .cse22))) (let ((.cse56 (store .cse52 .cse53 0))) (let ((.cse57 (@diff .cse56 .cse22))) (and (or (<= .cse50 .cse45) (= .cse22 .cse51)) (or (= .cse22 .cse52) (<= .cse53 .cse45)) (or (= .cse22 .cse54) (<= .cse55 .cse45)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse56 .cse57 0)) (or (<= .cse57 .cse45) (= .cse22 .cse56)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse60 (@diff .cse66 .cse22))) (let ((.cse62 (store .cse66 .cse60 0))) (let ((.cse61 (@diff .cse62 .cse22))) (and (or .cse59 (<= (+ .cse60 28) .cse8)) (or (<= (+ .cse61 28) .cse8) (= .cse22 .cse62)) .cse63 .cse64 (= .cse22 (store .cse62 .cse61 0)) .cse1 .cse41 .cse65))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse59 .cse63 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse64 .cse1) .cse0) (or (and .cse46 .cse9 .cse47 .cse48 .cse49) .cse6) (or .cse0 (let ((.cse73 (store .cse75 .cse58 0))) (let ((.cse74 (@diff .cse73 .cse22))) (let ((.cse67 (store .cse73 .cse74 0))) (let ((.cse68 (@diff .cse67 .cse22))) (let ((.cse71 (store .cse67 .cse68 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse69 (store .cse71 .cse72 0))) (let ((.cse70 (@diff .cse69 .cse22))) (and (or (= .cse22 .cse67) (<= (+ .cse68 28) .cse8)) (= .cse22 (store .cse69 .cse70 0)) (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (or (= .cse22 .cse73) (<= (+ .cse74 28) .cse8)) (or (<= (+ 28 .cse70) .cse8) (= .cse22 .cse69)) .cse1 .cse41 .cse65)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse82 (store .cse75 .cse76 0))) (let ((.cse81 (@diff .cse82 .cse22))) (let ((.cse77 (store .cse82 .cse81 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse80 (store .cse77 .cse78 0))) (let ((.cse79 (@diff .cse80 .cse22))) (and (or (<= (+ .cse76 28) .cse8) (= .cse22 .cse75)) .cse3 (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse79) .cse8) (= .cse22 .cse80)) (= .cse22 (store .cse80 .cse79 0)) (or (<= (+ 28 .cse81) .cse8) (= .cse22 .cse82)))))))))) .cse6) (or .cse0 (and (or .cse33 (<= .cse34 .cse45)) (or (<= .cse32 .cse45) .cse31) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse27 (<= .cse28 .cse45)) (or .cse39 (<= .cse38 .cse45)) (or (<= .cse37 .cse45) .cse36) .cse1 .cse35 (or (<= .cse29 .cse45) .cse30))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse83) .cse6)))))))))))))))) is different from true [2022-11-14 19:59:30,412 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse99 (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse62 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse26 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse88 (store .cse99 .cse62 0)) (.cse22 ((as const (Array Int Int)) 0))) (let ((.cse33 (@diff .cse88 .cse22)) (.cse20 (@diff .cse26 .cse22))) (let ((.cse105 (store .cse26 .cse20 0)) (.cse90 (store .cse88 .cse33 0))) (let ((.cse41 (@diff .cse90 .cse22)) (.cse11 (@diff .cse105 .cse22))) (let ((.cse106 (store .cse105 .cse11 0)) (.cse91 (store .cse90 .cse41 0))) (let ((.cse32 (@diff .cse91 .cse22)) (.cse12 (@diff .cse106 .cse22))) (let ((.cse104 (store .cse106 .cse12 0)) (.cse30 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse93 (store .cse91 .cse32 0))) (let ((.cse38 (@diff .cse93 .cse22)) (.cse103 (store .cse30 .cse62 0)) (.cse17 (@diff .cse104 .cse22))) (let ((.cse100 (@diff .cse30 .cse22)) (.cse94 (store .cse104 .cse17 0)) (.cse97 (@diff .cse103 .cse22)) (.cse92 (store .cse93 .cse38 0))) (let ((.cse36 (@diff .cse92 .cse22)) (.cse95 (store .cse103 .cse97 0)) (.cse7 (@diff .cse94 .cse22)) (.cse101 (store .cse30 .cse100 0))) (let ((.cse102 (@diff .cse101 .cse22)) (.cse98 (store .cse94 .cse7 0)) (.cse96 (@diff .cse95 .cse22)) (.cse89 (store .cse92 .cse36 0))) (let ((.cse42 (@diff .cse89 .cse22)) (.cse6 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse19 (= .cse22 .cse26)) (.cse13 (= .cse22 .cse106)) (.cse10 (= .cse22 .cse105)) (.cse49 (+ |c_~#cache~0.offset| (* |c_t_funThread1of1ForFork0_#t~post41#1| 28))) (.cse18 (= .cse22 .cse104)) (.cse44 (= .cse22 .cse103)) (.cse70 (store .cse95 .cse96 0)) (.cse16 (@diff .cse98 .cse22)) (.cse45 (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse87 (= .cse22 .cse30)) (.cse25 (store .cse101 .cse102 0)) (.cse8 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (let ((.cse2 (or (= .cse22 .cse101) (<= (+ .cse102 28) .cse8))) (.cse4 (= .cse22 .cse25)) (.cse5 (or (<= (+ .cse100 28) .cse8) .cse87)) (.cse46 (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (.cse47 (= (select .cse99 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) (.cse48 (and (not .cse45) (= (select .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0))) (.cse15 (= .cse22 .cse98)) (.cse14 (= .cse22 (store .cse98 .cse16 0))) (.cse63 (= .cse22 .cse70)) (.cse67 (or .cse44 (<= (+ 28 .cse97) .cse8))) (.cse68 (or (= .cse22 .cse95) (<= (+ 28 .cse96) .cse8))) (.cse50 (or (<= .cse17 .cse49) .cse18)) (.cse9 (= .cse22 .cse94)) (.cse51 (or .cse10 (<= .cse11 .cse49))) (.cse52 (or (<= .cse12 .cse49) .cse13)) (.cse53 (or (<= .cse20 .cse49) .cse19)) (.cse69 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (.cse79 (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 0)) (.cse0 (not .cse6)) (.cse37 (= .cse22 .cse93)) (.cse35 (= .cse22 .cse92)) (.cse31 (= .cse22 .cse91)) (.cse43 (= .cse22 .cse89)) (.cse40 (= .cse22 .cse90)) (.cse1 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse39 (= .cse22 (store .cse89 .cse42 0))) (.cse34 (= .cse88 .cse22)) (.cse3 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (or .cse0 .cse1) (or (and .cse2 .cse3 .cse4 .cse5) .cse6) (or (and (or (<= (+ .cse7 28) .cse8) .cse9) (or .cse10 (<= (+ .cse11 28) .cse8)) (or (<= (+ .cse12 28) .cse8) .cse13) .cse14 (or .cse15 (<= (+ .cse16 28) .cse8)) (or (<= (+ .cse17 28) .cse8) .cse18) (or .cse19 (<= (+ 28 .cse20) .cse8))) .cse6) (or (let ((.cse21 (@diff .cse25 .cse22))) (let ((.cse23 (store .cse25 .cse21 0))) (let ((.cse24 (@diff .cse23 .cse22))) (and .cse2 .cse3 (or (<= (+ .cse21 28) .cse8) .cse4) (= .cse22 (store .cse23 .cse24 0)) (or (= .cse22 .cse23) (<= (+ .cse24 28) .cse8)) .cse5)))) .cse6) (exists ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 28) .cse8) (= .cse26 (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307)))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (let ((.cse28 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (let ((.cse27 (+ .cse28 |c_~#cache~0.offset|))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ 2 |c_t_funThread1of1ForFork0_~i~0#1|)) (< .cse27 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (< .cse27 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| 28)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse28 28 |c_~#cache~0.offset|)) (< (select (select (store (let ((.cse29 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse30 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1307)))) (store .cse29 |c_~#cache~0.base| (store (store (select .cse29 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647))))) (or (and (or .cse31 (<= (+ .cse32 28) .cse8)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= (+ .cse33 28) .cse8) .cse34) (or .cse35 (<= (+ 28 .cse36) .cse8)) (or .cse37 (<= (+ .cse38 28) .cse8)) .cse1 .cse39 (or .cse40 (<= (+ .cse41 28) .cse8)) (or (<= (+ 28 .cse42) .cse8) .cse43)) .cse0) .cse3 (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or .cse0 (and .cse44 .cse1 .cse45)) (or (and .cse46 (= |c_ULTIMATE.start_main_#t~post43#1| 0) .cse45 .cse47) .cse48) (or (and .cse46 .cse1 .cse45 .cse47) .cse48) .cse19 (or (and (or .cse15 (<= .cse16 .cse49)) (or .cse9 (<= .cse7 .cse49)) .cse50 .cse14 .cse51 .cse52 .cse53) .cse6) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse8) (= (store (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse26) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse8))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse8) (exists ((v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| 28) .cse8) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse8) (= .cse26 (store (store .cse22 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310)))) (or .cse0 (let ((.cse55 (store .cse26 .cse62 0))) (let ((.cse54 (@diff .cse55 .cse22))) (let ((.cse58 (store .cse55 .cse54 0))) (let ((.cse59 (@diff .cse58 .cse22))) (let ((.cse56 (store .cse58 .cse59 0))) (let ((.cse57 (@diff .cse56 .cse22))) (let ((.cse60 (store .cse56 .cse57 0))) (let ((.cse61 (@diff .cse60 .cse22))) (and (or (<= .cse54 .cse49) (= .cse22 .cse55)) (or (= .cse22 .cse56) (<= .cse57 .cse49)) (or (= .cse22 .cse58) (<= .cse59 .cse49)) (<= 1 |c_t_funThread1of1ForFork0_#t~post41#1|) (= .cse22 (store .cse60 .cse61 0)) (or (<= .cse61 .cse49) (= .cse22 .cse60)) .cse1)))))))))) (= |c_~#cache~0.offset| 0) (or .cse0 (let ((.cse64 (@diff .cse70 .cse22))) (let ((.cse66 (store .cse70 .cse64 0))) (let ((.cse65 (@diff .cse66 .cse22))) (and (or .cse63 (<= (+ .cse64 28) .cse8)) (or (<= (+ .cse65 28) .cse8) (= .cse22 .cse66)) .cse67 .cse68 (= .cse22 (store .cse66 .cse65 0)) .cse1 .cse45 .cse69))))) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_t_funThread1of1ForFork0_~i~0#1| 0) (or (and .cse3 .cse63 .cse67 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse68 .cse1) .cse0) (or (and .cse50 .cse9 .cse51 .cse52 .cse53) .cse6) (or .cse0 (let ((.cse77 (store .cse79 .cse62 0))) (let ((.cse78 (@diff .cse77 .cse22))) (let ((.cse71 (store .cse77 .cse78 0))) (let ((.cse72 (@diff .cse71 .cse22))) (let ((.cse75 (store .cse71 .cse72 0))) (let ((.cse76 (@diff .cse75 .cse22))) (let ((.cse73 (store .cse75 .cse76 0))) (let ((.cse74 (@diff .cse73 .cse22))) (and (or (= .cse22 .cse71) (<= (+ .cse72 28) .cse8)) (= .cse22 (store .cse73 .cse74 0)) (or (= .cse22 .cse75) (<= (+ .cse76 28) .cse8)) (or (= .cse22 .cse77) (<= (+ .cse78 28) .cse8)) (or (<= (+ 28 .cse74) .cse8) (= .cse22 .cse73)) .cse1 .cse45 .cse69)))))))))) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse80 (@diff .cse79 .cse22))) (let ((.cse86 (store .cse79 .cse80 0))) (let ((.cse85 (@diff .cse86 .cse22))) (let ((.cse81 (store .cse86 .cse85 0))) (let ((.cse82 (@diff .cse81 .cse22))) (let ((.cse84 (store .cse81 .cse82 0))) (let ((.cse83 (@diff .cse84 .cse22))) (and (or (<= (+ .cse80 28) .cse8) (= .cse22 .cse79)) .cse3 (or (= .cse22 .cse81) (<= (+ .cse82 28) .cse8)) (or (<= (+ 28 .cse83) .cse8) (= .cse22 .cse84)) (= .cse22 (store .cse84 .cse83 0)) (or (<= (+ 28 .cse85) .cse8) (= .cse22 .cse86)))))))))) .cse6) (or .cse0 (and (or .cse37 (<= .cse38 .cse49)) (or (<= .cse36 .cse49) .cse35) (<= 2 |c_t_funThread1of1ForFork0_#t~post41#1|) (or .cse31 (<= .cse32 .cse49)) (or .cse43 (<= .cse42 .cse49)) (or (<= .cse41 .cse49) .cse40) .cse1 .cse39 (or (<= .cse33 .cse49) .cse34))) (= |c_~#cache~0.base| 3) (or (and .cse3 .cse87) .cse6)))))))))))))))) is different from true [2022-11-14 20:00:11,385 WARN L233 SmtUtils]: Spent 40.39s on a formula simplification. DAG size of input: 159 DAG size of output: 32 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 20:01:11,527 WARN L233 SmtUtils]: Spent 42.42s on a formula simplification. DAG size of input: 162 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 20:02:01,684 WARN L233 SmtUtils]: Spent 10.92s on a formula simplification. DAG size of input: 201 DAG size of output: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-14 20:02:14,310 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse80 (+ (* |c_ULTIMATE.start_main_~i~3#1| 4) |c_ULTIMATE.start_main_~#t_ids~0#1.offset|))) (let ((.cse67 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base|) .cse80 0)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse68 (@diff .cse67 .cse0))) (let ((.cse72 (store .cse67 .cse68 0))) (let ((.cse35 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse71 (@diff .cse72 .cse0))) (let ((.cse74 (store .cse72 .cse71 0)) (.cse79 (@diff .cse35 .cse0))) (let ((.cse78 (store .cse35 .cse79 0)) (.cse73 (@diff .cse74 .cse0))) (let ((.cse70 (store .cse74 .cse73 0)) (.cse77 (@diff .cse78 .cse0))) (let ((.cse58 (store .cse35 .cse80 0)) (.cse61 (store .cse78 .cse77 0)) (.cse69 (@diff .cse70 .cse0))) (let ((.cse76 (store .cse70 .cse69 0)) (.cse64 (@diff .cse61 .cse0)) (.cse57 (@diff .cse58 .cse0))) (let ((.cse60 (store .cse58 .cse57 0)) (.cse63 (store .cse61 .cse64 0)) (.cse75 (@diff .cse76 .cse0))) (let ((.cse65 (store .cse76 .cse75 0)) (.cse62 (@diff .cse63 .cse0)) (.cse59 (@diff .cse60 .cse0))) (let ((.cse56 (store .cse60 .cse59 0)) (.cse14 (= |c_~#cache~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (.cse42 (= .cse0 .cse35)) (.cse41 (+ .cse79 28)) (.cse46 (= .cse0 .cse78)) (.cse45 (+ .cse77 28)) (.cse2 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) (.cse50 (store .cse63 .cse62 0)) (.cse66 (@diff .cse65 .cse0))) (let ((.cse12 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse32 (+ 28 .cse66)) (.cse33 (= .cse0 .cse65)) (.cse25 (= .cse0 .cse76)) (.cse26 (+ 28 .cse75)) (.cse21 (= .cse0 .cse74)) (.cse22 (+ .cse73 28)) (.cse30 (= .cse0 .cse72)) (.cse31 (+ .cse71 28)) (.cse27 (= .cse0 .cse70)) (.cse28 (+ .cse69 28)) (.cse23 (+ .cse68 28)) (.cse24 (= .cse67 .cse0)) (.cse29 (= .cse0 (store .cse65 .cse66 0))) (.cse37 (= .cse0 .cse50)) (.cse48 (+ .cse64 28)) (.cse39 (= .cse63 .cse0)) (.cse40 (+ .cse62 28)) (.cse15 (= |c_~#cache~0.base| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|)) (.cse49 (= .cse61 .cse0)) (.cse51 (or .cse46 (<= .cse45 .cse2))) (.cse52 (or .cse42 (<= .cse41 .cse2))) (.cse20 (not .cse14)) (.cse19 (= .cse0 .cse56)) (.cse16 (or (<= (+ .cse59 28) .cse2) (= .cse60 .cse0))) (.cse17 (or (<= (+ .cse57 28) .cse2) (= .cse0 .cse58))) (.cse18 (= |c_ULTIMATE.start_main_~i~3#1| 0)) (.cse47 (= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) (select |c_#memory_int| 3)) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|))) (or (let ((.cse13 (@diff .cse12 .cse0))) (let ((.cse4 (store .cse12 .cse13 0))) (let ((.cse5 (@diff .cse4 .cse0))) (let ((.cse7 (store .cse4 .cse5 0))) (let ((.cse6 (@diff .cse7 .cse0))) (let ((.cse11 (store .cse7 .cse6 0))) (let ((.cse10 (@diff .cse11 .cse0))) (let ((.cse3 (store .cse11 .cse10 0))) (let ((.cse1 (@diff .cse3 .cse0))) (let ((.cse8 (store .cse3 .cse1 0))) (let ((.cse9 (@diff .cse8 .cse0))) (and (or (<= (+ .cse1 28) .cse2) (= .cse0 .cse3)) (or (= .cse0 .cse4) (<= (+ .cse5 28) .cse2)) (or (<= (+ .cse6 28) .cse2) (= .cse0 .cse7)) (= .cse0 (store .cse8 .cse9 0)) (or (= .cse0 .cse8) (<= (+ .cse9 28) .cse2)) (or (<= (+ .cse10 28) .cse2) (= .cse0 .cse11)) (or (= .cse0 .cse12) (<= (+ 28 .cse13) .cse2)))))))))))))) .cse14) (= 3 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base|) (exists ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse2) (= .cse12 (store .cse0 |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1307)))) .cse15 (or (and .cse15 (<= 1 |c_t_funThread1of1ForFork0_~i~0#1|) .cse16 .cse17 .cse18 .cse19) .cse20) (or (and (or .cse21 (<= .cse22 .cse2)) (<= 3 |c_t_funThread1of1ForFork0_~i~0#1|) (or (<= .cse23 .cse2) .cse24) (or .cse25 (<= .cse26 .cse2)) (or .cse27 (<= .cse28 .cse2)) .cse18 .cse29 (or .cse30 (<= .cse31 .cse2)) (or (<= .cse32 .cse2) .cse33)) .cse20) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| Int) (v_ArrVal_1316 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_43| Int) (v_ArrVal_1310 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| Int) (v_ArrVal_1315 Int)) (let ((.cse36 (* |v_t_funThread1of1ForFork0_~i~0#1_43| 28))) (or (< (select (select (store (let ((.cse34 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| (store .cse35 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| v_ArrVal_1310)))) (store .cse34 |c_~#cache~0.base| (store (select .cse34 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61| v_ArrVal_1315))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1316) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59|) 2147483647) (< (+ .cse36 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_61|) (not (<= |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_43| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_59| (+ .cse36 28 |c_~#cache~0.offset|))))) (<= |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset| .cse2) (not (= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.offset| 0) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse2) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) .cse2) (= (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1310) .cse12))) (exists ((v_ArrVal_1310 Int) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (v_ArrVal_1315 Int) (v_ArrVal_1307 Int)) (and (<= (+ |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| 28) .cse2) (<= (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57|) .cse2) (= (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1307) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_57| v_ArrVal_1310) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1315) .cse12) (<= (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| 84) .cse2))) (= |c_~#cache~0.offset| 0) (not (= 3 |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (<= 2 |c_ULTIMATE.start_main_~#t_ids~0#1.base|) (or (let ((.cse38 (@diff .cse50 .cse0))) (let ((.cse44 (store .cse50 .cse38 0))) (let ((.cse43 (@diff .cse44 .cse0))) (and (or .cse37 (<= (+ .cse38 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse39 (<= .cse40 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse41 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse42) (or (<= (+ .cse43 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= .cse0 .cse44)) (or (<= .cse45 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse46) (= .cse0 (store .cse44 .cse43 0)) (not .cse47) (or (<= .cse48 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse49))))) (and (<= 84 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (or (<= .cse32 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse33) (or .cse25 (<= .cse26 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse21 (<= .cse22 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse30 (<= .cse31 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or .cse27 (<= .cse28 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|)) (or (<= .cse23 |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) .cse24) .cse18 .cse29 .cse47)) (or (and .cse15 .cse37 .cse51 .cse52 (or (<= .cse48 .cse2) .cse49) (or .cse39 (<= .cse40 .cse2))) .cse14) (= |c_~#cache~0.base| 3) (or (and .cse15 .cse49 .cse51 .cse52) .cse14) (or .cse20 (let ((.cse53 (@diff .cse56 .cse0))) (let ((.cse55 (store .cse56 .cse53 0))) (let ((.cse54 (@diff .cse55 .cse0))) (and (or .cse19 (<= (+ .cse53 28) .cse2)) .cse16 .cse17 (or (<= (+ .cse54 28) .cse2) (= .cse0 .cse55)) (= .cse0 (store .cse55 .cse54 0)) .cse18 .cse47 (<= 2 |c_t_funThread1of1ForFork0_~i~0#1|))))))))))))))))))))) is different from true Received shutdown request... [2022-11-14 20:02:27,897 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 20:02:27,899 WARN L249 SmtUtils]: Removed 20 from assertion stack [2022-11-14 20:02:27,903 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 20:02:27,903 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-11-14 20:02:27,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-11-14 20:02:28,099 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,SelfDestructingSolverStorable16 [2022-11-14 20:02:28,100 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. [2022-11-14 20:02:28,101 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-14 20:02:28,102 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-14 20:02:28,102 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-14 20:02:28,102 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-14 20:02:28,102 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-14 20:02:28,102 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-14 20:02:28,105 INFO L444 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-14 20:02:28,106 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2022-11-14 20:02:28,107 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-14 20:02:28,107 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-14 20:02:28,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 08:02:28 BasicIcfg [2022-11-14 20:02:28,109 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-14 20:02:28,109 INFO L158 Benchmark]: Toolchain (without parser) took 868294.32ms. Allocated memory was 179.3MB in the beginning and 657.5MB in the end (delta: 478.2MB). Free memory was 125.1MB in the beginning and 564.8MB in the end (delta: -439.7MB). Peak memory consumption was 382.9MB. Max. memory is 8.0GB. [2022-11-14 20:02:28,109 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 179.3MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-11-14 20:02:28,109 INFO L158 Benchmark]: CACSL2BoogieTranslator took 630.57ms. Allocated memory is still 179.3MB. Free memory was 124.9MB in the beginning and 135.2MB in the end (delta: -10.4MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-11-14 20:02:28,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.49ms. Allocated memory is still 179.3MB. Free memory was 135.2MB in the beginning and 132.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-11-14 20:02:28,109 INFO L158 Benchmark]: Boogie Preprocessor took 43.28ms. Allocated memory is still 179.3MB. Free memory was 132.1MB in the beginning and 129.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-11-14 20:02:28,110 INFO L158 Benchmark]: RCFGBuilder took 441.65ms. Allocated memory is still 179.3MB. Free memory was 129.8MB in the beginning and 107.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2022-11-14 20:02:28,110 INFO L158 Benchmark]: TraceAbstraction took 867104.94ms. Allocated memory was 179.3MB in the beginning and 657.5MB in the end (delta: 478.2MB). Free memory was 106.2MB in the beginning and 564.8MB in the end (delta: -458.6MB). Peak memory consumption was 363.7MB. Max. memory is 8.0GB. [2022-11-14 20:02:28,110 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.39ms. Allocated memory is still 179.3MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 630.57ms. Allocated memory is still 179.3MB. Free memory was 124.9MB in the beginning and 135.2MB in the end (delta: -10.4MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.49ms. Allocated memory is still 179.3MB. Free memory was 135.2MB in the beginning and 132.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.28ms. Allocated memory is still 179.3MB. Free memory was 132.1MB in the beginning and 129.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 441.65ms. Allocated memory is still 179.3MB. Free memory was 129.8MB in the beginning and 107.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 867104.94ms. Allocated memory was 179.3MB in the beginning and 657.5MB in the end (delta: 478.2MB). Free memory was 106.2MB in the beginning and 564.8MB in the end (delta: -458.6MB). Peak memory consumption was 363.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30422, independent: 29260, independent conditional: 2227, independent unconditional: 27033, dependent: 1162, dependent conditional: 1073, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29359, independent: 29260, independent conditional: 2227, independent unconditional: 27033, dependent: 99, dependent conditional: 10, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29359, independent: 29260, independent conditional: 2227, independent unconditional: 27033, dependent: 99, dependent conditional: 10, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29414, independent: 29260, independent conditional: 0, independent unconditional: 29260, dependent: 154, dependent conditional: 55, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29414, independent: 29260, independent conditional: 0, independent unconditional: 29260, dependent: 154, dependent conditional: 20, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29414, independent: 29260, independent conditional: 0, independent unconditional: 29260, dependent: 154, dependent conditional: 20, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14080, independent: 13971, independent conditional: 0, independent unconditional: 13971, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14080, independent: 13945, independent conditional: 0, independent unconditional: 13945, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 206, dependent conditional: 28, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 29414, independent: 15289, independent conditional: 0, independent unconditional: 15289, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 14080, unknown conditional: 20, unknown unconditional: 14060] , Statistics on independence cache: Total cache size (in pairs): 14080, Positive cache size: 13971, Positive conditional cache size: 0, Positive unconditional cache size: 13971, Negative cache size: 109, Negative conditional cache size: 20, Negative unconditional cache size: 89, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 6, Independence queries for same thread: 1063 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 0.4s, Number of persistent set computation: 514, Number of trivial persistent sets: 267, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 27122, independent: 27033, independent conditional: 0, independent unconditional: 27033, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 30422, independent: 29260, independent conditional: 2227, independent unconditional: 27033, dependent: 1162, dependent conditional: 1073, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29359, independent: 29260, independent conditional: 2227, independent unconditional: 27033, dependent: 99, dependent conditional: 10, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 29359, independent: 29260, independent conditional: 2227, independent unconditional: 27033, dependent: 99, dependent conditional: 10, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 29414, independent: 29260, independent conditional: 0, independent unconditional: 29260, dependent: 154, dependent conditional: 55, dependent unconditional: 99, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 29414, independent: 29260, independent conditional: 0, independent unconditional: 29260, dependent: 154, dependent conditional: 20, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 29414, independent: 29260, independent conditional: 0, independent unconditional: 29260, dependent: 154, dependent conditional: 20, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 14080, independent: 13971, independent conditional: 0, independent unconditional: 13971, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 14080, independent: 13945, independent conditional: 0, independent unconditional: 13945, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 135, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 109, dependent conditional: 20, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 325, independent: 119, independent conditional: 0, independent unconditional: 119, dependent: 206, dependent conditional: 28, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 29414, independent: 15289, independent conditional: 0, independent unconditional: 15289, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 14080, unknown conditional: 20, unknown unconditional: 14060] , Statistics on independence cache: Total cache size (in pairs): 14080, Positive cache size: 13971, Positive conditional cache size: 0, Positive unconditional cache size: 13971, Negative cache size: 109, Negative conditional cache size: 20, Negative unconditional cache size: 89, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 35, Maximal queried relation: 6, Independence queries for same thread: 1063 - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. - TimeoutResultAtElement [Line: 946]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 221 for 5200ms.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 321 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 866.9s, OverallIterations: 17, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 537.5s, 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: 234, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 325.1s InterpolantComputationTime, 4475 NumberOfCodeBlocks, 4405 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 5646 ConstructedInterpolants, 823 QuantifiedInterpolants, 209740 SizeOfPredicates, 117 NumberOfNonLiveVariables, 3947 ConjunctsInSsa, 209 ConjunctsInUnsatCore, 35 InterpolantComputations, 10 PerfectInterpolantSequences, 8564/10133 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