/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-02 00:51:24,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-02 00:51:24,975 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-02 00:51:25,044 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-02 00:51:25,044 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-02 00:51:25,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-02 00:51:25,046 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-02 00:51:25,055 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-02 00:51:25,057 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-02 00:51:25,061 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-02 00:51:25,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-02 00:51:25,063 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-02 00:51:25,063 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-02 00:51:25,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-02 00:51:25,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-02 00:51:25,067 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-02 00:51:25,068 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-02 00:51:25,069 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-02 00:51:25,071 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-02 00:51:25,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-02 00:51:25,077 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-02 00:51:25,078 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-02 00:51:25,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-02 00:51:25,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-02 00:51:25,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-02 00:51:25,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-02 00:51:25,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-02 00:51:25,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-02 00:51:25,088 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-02 00:51:25,089 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-02 00:51:25,089 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-02 00:51:25,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-02 00:51:25,091 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-02 00:51:25,092 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-02 00:51:25,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-02 00:51:25,093 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-02 00:51:25,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-02 00:51:25,093 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-02 00:51:25,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-02 00:51:25,094 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-02 00:51:25,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-02 00:51:25,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-MCRwithDepranks-Lazy-NoForkJoinOpt.epf [2022-03-02 00:51:25,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-02 00:51:25,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-02 00:51:25,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-02 00:51:25,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-02 00:51:25,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-02 00:51:25,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-02 00:51:25,127 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-02 00:51:25,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-02 00:51:25,127 INFO L138 SettingsManager]: * Use SBE=true [2022-03-02 00:51:25,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-02 00:51:25,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-02 00:51:25,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-02 00:51:25,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-02 00:51:25,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-02 00:51:25,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-02 00:51:25,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-02 00:51:25,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-02 00:51:25,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-02 00:51:25,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 00:51:25,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-02 00:51:25,131 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-02 00:51:25,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-02 00:51:25,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-02 00:51:25,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-02 00:51:25,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-02 00:51:25,131 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-02 00:51:25,132 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-02 00:51:25,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-02 00:51:25,132 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-02 00:51:25,132 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-02 00:51:25,132 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 [2022-03-02 00:51:25,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-02 00:51:25,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-02 00:51:25,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-02 00:51:25,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-02 00:51:25,379 INFO L275 PluginConnector]: CDTParser initialized [2022-03-02 00:51:25,380 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-03-02 00:51:25,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1b9c546/577f0d28f02b43e684e44bdea660a4ca/FLAG141959ea9 [2022-03-02 00:51:25,848 INFO L306 CDTParser]: Found 1 translation units. [2022-03-02 00:51:25,848 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-03-02 00:51:25,860 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1b9c546/577f0d28f02b43e684e44bdea660a4ca/FLAG141959ea9 [2022-03-02 00:51:26,184 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e1b9c546/577f0d28f02b43e684e44bdea660a4ca [2022-03-02 00:51:26,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-02 00:51:26,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-02 00:51:26,189 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-02 00:51:26,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-02 00:51:26,192 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-02 00:51:26,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5fe833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26, skipping insertion in model container [2022-03-02 00:51:26,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-02 00:51:26,257 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-02 00:51:26,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-03-02 00:51:26,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 00:51:26,629 INFO L203 MainTranslator]: Completed pre-run [2022-03-02 00:51:26,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-03-02 00:51:26,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-02 00:51:26,724 INFO L208 MainTranslator]: Completed translation [2022-03-02 00:51:26,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26 WrapperNode [2022-03-02 00:51:26,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-02 00:51:26,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-02 00:51:26,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-02 00:51:26,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-02 00:51:26,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,779 INFO L137 Inliner]: procedures = 277, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2022-03-02 00:51:26,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-02 00:51:26,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-02 00:51:26,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-02 00:51:26,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-02 00:51:26,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,800 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,803 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-02 00:51:26,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-02 00:51:26,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-02 00:51:26,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-02 00:51:26,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (1/1) ... [2022-03-02 00:51:26,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-02 00:51:26,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:26,852 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-03-02 00:51:26,872 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-03-02 00:51:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-02 00:51:26,885 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-02 00:51:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-02 00:51:26,885 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-02 00:51:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-02 00:51:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-02 00:51:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-02 00:51:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-02 00:51:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-02 00:51:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-02 00:51:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-02 00:51:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-02 00:51:26,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-02 00:51:26,887 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-02 00:51:26,979 INFO L234 CfgBuilder]: Building ICFG [2022-03-02 00:51:26,981 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-02 00:51:27,205 INFO L275 CfgBuilder]: Performing block encoding [2022-03-02 00:51:27,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-02 00:51:27,214 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-02 00:51:27,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 12:51:27 BoogieIcfgContainer [2022-03-02 00:51:27,216 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-02 00:51:27,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-02 00:51:27,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-02 00:51:27,220 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-02 00:51:27,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.03 12:51:26" (1/3) ... [2022-03-02 00:51:27,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a614061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 12:51:27, skipping insertion in model container [2022-03-02 00:51:27,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.03 12:51:26" (2/3) ... [2022-03-02 00:51:27,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a614061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.03 12:51:27, skipping insertion in model container [2022-03-02 00:51:27,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.03 12:51:27" (3/3) ... [2022-03-02 00:51:27,222 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-03-02 00:51:27,226 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-02 00:51:27,226 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-02 00:51:27,226 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-02 00:51:27,226 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-02 00:51:27,282 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,283 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,284 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,285 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,286 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,287 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,288 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,289 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,289 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,289 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,289 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,289 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,290 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,290 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,290 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,290 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,290 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,291 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,292 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,292 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,292 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,292 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,292 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,293 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,294 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,295 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,296 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,297 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,297 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,297 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,297 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,297 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,297 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,298 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,299 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,300 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,301 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,302 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,303 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,304 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,305 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,306 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,307 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,308 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,309 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,310 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,311 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,312 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,313 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,314 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,315 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,316 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,317 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,318 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,319 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,320 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,321 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,322 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,323 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,324 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,325 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,326 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,327 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,328 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,329 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,330 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,331 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,332 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,332 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,332 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,332 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,333 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,333 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,333 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,333 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,336 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,336 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,336 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,337 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,338 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,339 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,341 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,342 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,342 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,342 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,342 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,342 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,342 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,343 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,343 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,343 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,343 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,343 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,343 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,344 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,344 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,344 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,344 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,344 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,344 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-02 00:51:27,347 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-02 00:51:27,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-02 00:51:27,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:27,387 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-03-02 00:51:27,398 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-03-02 00:51:27,420 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-02 00:51:27,424 INFO L339 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, mLazyFiniteAutomaton=true, 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, mLoopAccelerationTechnique=FAST_UPR, mMcrOptimizeForkJoin=false, mMcrOverapproximateWrwc=true [2022-03-02 00:51:27,424 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-02 00:51:27,489 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-02 00:51:27,491 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:27,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:27,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1174616020, now seen corresponding path program 1 times [2022-03-02 00:51:27,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:27,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989199734] [2022-03-02 00:51:27,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:27,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:27,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:27,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989199734] [2022-03-02 00:51:27,739 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989199734] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:27,739 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:51:27,739 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-02 00:51:27,740 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288683118] [2022-03-02 00:51:27,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:27,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-02 00:51:27,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:27,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-02 00:51:27,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-02 00:51:27,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,768 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:27,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 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-03-02 00:51:27,770 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,826 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-02 00:51:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-02 00:51:27,827 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:27,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:27,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1170051021, now seen corresponding path program 1 times [2022-03-02 00:51:27,828 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:27,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553370331] [2022-03-02 00:51:27,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:27,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:27,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:27,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:27,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553370331] [2022-03-02 00:51:27,909 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553370331] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:27,909 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:51:27,909 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 00:51:27,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887183296] [2022-03-02 00:51:27,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:27,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 00:51:27,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:27,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 00:51:27,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 00:51:27,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,911 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:27,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 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-03-02 00:51:27,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,944 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 158 transitions and produced 124 states. [2022-03-02 00:51:27,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:27,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:27,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-02 00:51:27,945 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:27,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 323884447, now seen corresponding path program 1 times [2022-03-02 00:51:27,946 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:27,946 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313099204] [2022-03-02 00:51:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:28,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:28,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:28,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313099204] [2022-03-02 00:51:28,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313099204] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:28,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:51:28,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 00:51:28,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110357146] [2022-03-02 00:51:28,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:28,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 00:51:28,076 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:28,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 00:51:28,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 00:51:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,077 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:28,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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-03-02 00:51:28,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,116 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 209 transitions and produced 157 states. [2022-03-02 00:51:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-02 00:51:28,119 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:28,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2033537427, now seen corresponding path program 1 times [2022-03-02 00:51:28,120 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:28,120 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021321420] [2022-03-02 00:51:28,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:28,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:28,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:28,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:28,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021321420] [2022-03-02 00:51:28,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021321420] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:28,197 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:51:28,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-02 00:51:28,197 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867830359] [2022-03-02 00:51:28,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:28,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-02 00:51:28,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:28,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-02 00:51:28,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-02 00:51:28,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,198 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:28,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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-03-02 00:51:28,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,199 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,243 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 235 transitions and produced 183 states. [2022-03-02 00:51:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-02 00:51:28,244 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:28,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1519561133, now seen corresponding path program 1 times [2022-03-02 00:51:28,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:28,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611593451] [2022-03-02 00:51:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:28,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:28,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:28,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:28,314 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611593451] [2022-03-02 00:51:28,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611593451] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:28,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-02 00:51:28,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-02 00:51:28,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642039825] [2022-03-02 00:51:28,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:28,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-02 00:51:28,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:28,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-02 00:51:28,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-02 00:51:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,317 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:28,317 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 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-03-02 00:51:28,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,387 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 223 transitions and produced 224 states. [2022-03-02 00:51:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:28,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-02 00:51:28,398 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:28,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:28,398 INFO L85 PathProgramCache]: Analyzing trace with hash -818256019, now seen corresponding path program 1 times [2022-03-02 00:51:28,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:28,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543625242] [2022-03-02 00:51:28,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:28,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:28,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:28,548 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:28,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543625242] [2022-03-02 00:51:28,548 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543625242] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:28,548 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572722793] [2022-03-02 00:51:28,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:28,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:28,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:28,550 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-03-02 00:51:28,552 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-03-02 00:51:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:28,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 00:51:28,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:28,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:28,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:51:29,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:29,219 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572722793] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:51:29,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:51:29,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 00:51:29,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889959444] [2022-03-02 00:51:29,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:51:29,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 00:51:29,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:29,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 00:51:29,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 00:51:29,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:29,227 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:29,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.3) internal successors, (213), 10 states have internal predecessors, (213), 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-03-02 00:51:29,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:29,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:29,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:29,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:29,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:29,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:29,279 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 394 transitions and produced 289 states. [2022-03-02 00:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-02 00:51:29,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-03-02 00:51:29,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-03-02 00:51:29,497 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:29,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:29,497 INFO L85 PathProgramCache]: Analyzing trace with hash 148992281, now seen corresponding path program 1 times [2022-03-02 00:51:29,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:29,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129810551] [2022-03-02 00:51:29,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:29,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:29,606 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:29,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:29,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129810551] [2022-03-02 00:51:29,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129810551] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:29,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122623489] [2022-03-02 00:51:29,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:29,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:29,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:29,612 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:51:29,613 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-03-02 00:51:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:29,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-02 00:51:29,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:29,929 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:29,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:51:30,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:30,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122623489] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:51:30,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:51:30,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-02 00:51:30,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713713325] [2022-03-02 00:51:30,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:51:30,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-02 00:51:30,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-02 00:51:30,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-02 00:51:30,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:30,157 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:30,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.9) internal successors, (279), 10 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-03-02 00:51:30,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:30,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:30,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:30,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:30,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:30,157 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-02 00:51:30,158 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:30,283 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 687 transitions and produced 529 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:30,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:30,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-03-02 00:51:30,498 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:30,498 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:30,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:30,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1058312109, now seen corresponding path program 2 times [2022-03-02 00:51:30,499 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:30,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249788850] [2022-03-02 00:51:30,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:30,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:30,677 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:30,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249788850] [2022-03-02 00:51:30,677 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249788850] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:30,677 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269200881] [2022-03-02 00:51:30,678 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:51:30,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:30,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:30,680 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-03-02 00:51:30,711 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-03-02 00:51:30,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:51:30,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:51:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-02 00:51:30,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:31,241 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:31,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 00:51:31,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269200881] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:31,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 00:51:31,242 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-03-02 00:51:31,242 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017334400] [2022-03-02 00:51:31,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:31,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-02 00:51:31,245 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:31,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-02 00:51:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-03-02 00:51:31,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:31,248 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:31,248 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.181818181818183) internal successors, (211), 11 states have internal predecessors, (211), 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-03-02 00:51:31,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:31,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:31,462 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 715 transitions and produced 557 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:31,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:31,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:31,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-03-02 00:51:31,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:31,684 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:31,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1593386593, now seen corresponding path program 1 times [2022-03-02 00:51:31,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:31,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086786584] [2022-03-02 00:51:31,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:31,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:31,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:31,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086786584] [2022-03-02 00:51:31,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086786584] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:31,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868935591] [2022-03-02 00:51:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:31,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:31,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:31,795 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-03-02 00:51:31,820 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-03-02 00:51:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:31,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 00:51:31,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:32,325 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:32,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:51:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:32,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868935591] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:51:32,665 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:51:32,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-02 00:51:32,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655910945] [2022-03-02 00:51:32,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:51:32,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 00:51:32,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:32,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 00:51:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-02 00:51:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:32,667 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:32,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.076923076923077) internal successors, (313), 13 states have internal predecessors, (313), 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-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:32,668 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:32,771 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 764 transitions and produced 553 states. [2022-03-02 00:51:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:32,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-02 00:51:32,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-03-02 00:51:32,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:32,996 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:32,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:32,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1431502631, now seen corresponding path program 2 times [2022-03-02 00:51:32,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:32,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146184397] [2022-03-02 00:51:32,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:32,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:33,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:33,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146184397] [2022-03-02 00:51:33,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146184397] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:33,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011866711] [2022-03-02 00:51:33,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:51:33,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:33,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:33,104 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-03-02 00:51:33,111 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-03-02 00:51:33,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:51:33,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:51:33,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-02 00:51:33,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:33,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:51:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:34,016 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011866711] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:51:34,016 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:51:34,016 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-02 00:51:34,016 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153037055] [2022-03-02 00:51:34,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:51:34,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 00:51:34,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:34,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 00:51:34,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-02 00:51:34,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:34,018 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:34,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.76923076923077) internal successors, (348), 13 states have internal predecessors, (348), 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-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-02 00:51:34,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:34,202 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1085 transitions and produced 821 states. [2022-03-02 00:51:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:34,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:34,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:34,230 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-03-02 00:51:34,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:34,420 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1603129695, now seen corresponding path program 2 times [2022-03-02 00:51:34,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:34,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715898547] [2022-03-02 00:51:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:35,499 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:35,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:35,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715898547] [2022-03-02 00:51:35,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715898547] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:35,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114917680] [2022-03-02 00:51:35,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:51:35,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:35,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:35,504 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-03-02 00:51:35,505 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-03-02 00:51:35,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:51:35,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:51:35,674 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-02 00:51:35,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:36,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-02 00:51:38,047 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-02 00:51:38,277 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-03-02 00:51:38,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 00:51:38,278 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114917680] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:51:38,278 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 00:51:38,278 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [32] total 52 [2022-03-02 00:51:38,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685913842] [2022-03-02 00:51:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:51:38,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-02 00:51:38,281 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:38,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-02 00:51:38,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2522, Unknown=0, NotChecked=0, Total=2652 [2022-03-02 00:51:38,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:38,282 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:38,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 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-03-02 00:51:38,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:38,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:38,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:38,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:38,283 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:43,907 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1144 transitions and produced 880 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:43,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:43,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:51:43,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-03-02 00:51:44,111 WARN L452 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-03-02 00:51:44,112 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:44,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:44,112 INFO L85 PathProgramCache]: Analyzing trace with hash 390942809, now seen corresponding path program 1 times [2022-03-02 00:51:44,113 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:44,113 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010950046] [2022-03-02 00:51:44,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:44,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:44,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 318 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:44,359 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:44,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010950046] [2022-03-02 00:51:44,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010950046] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:44,359 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532721376] [2022-03-02 00:51:44,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:44,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:44,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:44,361 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-03-02 00:51:44,389 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-03-02 00:51:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:44,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-02 00:51:44,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:45,114 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:45,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:51:45,725 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:45,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532721376] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:51:45,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:51:45,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2022-03-02 00:51:45,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226816629] [2022-03-02 00:51:45,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:51:45,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-02 00:51:45,727 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:51:45,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-02 00:51:45,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-02 00:51:45,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:45,727 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:51:45,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 23.62962962962963) internal successors, (638), 27 states have internal predecessors, (638), 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-03-02 00:51:45,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:45,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:45,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:45,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:45,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:45,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:45,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:45,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:45,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:45,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:45,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:51:45,729 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:46,168 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1172 transitions and produced 908 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:51:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:51:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:51:46,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-02 00:51:46,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-03-02 00:51:46,383 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-03-02 00:51:46,384 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:51:46,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:51:46,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1682786829, now seen corresponding path program 1 times [2022-03-02 00:51:46,384 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:51:46,384 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076544689] [2022-03-02 00:51:46,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:46,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:51:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:51:47,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:51:47,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076544689] [2022-03-02 00:51:47,724 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076544689] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:51:47,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325087147] [2022-03-02 00:51:47,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:51:47,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:51:47,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:51:47,728 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-03-02 00:51:47,729 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-03-02 00:51:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:51:47,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-02 00:51:47,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:51:48,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-02 00:51:49,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:51:49,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-02 00:51:51,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-02 00:51:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 74 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-03-02 00:51:51,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:51:54,752 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-02 00:52:31,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-02 00:52:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 73 refuted. 0 times theorem prover too weak. 150 trivial. 1 not checked. [2022-03-02 00:52:32,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325087147] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:52:32,089 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:52:32,089 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 29] total 91 [2022-03-02 00:52:32,089 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258345784] [2022-03-02 00:52:32,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:52:32,090 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-02 00:52:32,091 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:52:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-02 00:52:32,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=7693, Unknown=20, NotChecked=176, Total=8190 [2022-03-02 00:52:32,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:52:32,094 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:52:32,094 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 9.31868131868132) internal successors, (848), 91 states have internal predecessors, (848), 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-03-02 00:52:32,094 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-03-02 00:52:32,095 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:52:38,460 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:52:43,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:52:48,258 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 3 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 3) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-02 00:52:52,690 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (+ |c_~#arr~0.offset| 12))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse6)) (.cse4 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse6))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse5) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= .cse5 4) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-02 00:52:59,859 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1259 transitions and produced 995 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:52:59,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:52:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:52:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:52:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:52:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:52:59,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:52:59,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-03-02 00:53:00,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-03-02 00:53:00,072 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:53:00,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:53:00,072 INFO L85 PathProgramCache]: Analyzing trace with hash -995008903, now seen corresponding path program 2 times [2022-03-02 00:53:00,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:53:00,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864302394] [2022-03-02 00:53:00,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:53:00,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:53:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:53:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:53:01,644 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:53:01,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864302394] [2022-03-02 00:53:01,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864302394] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:53:01,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897771366] [2022-03-02 00:53:01,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:53:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:53:01,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:53:01,646 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-03-02 00:53:01,664 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-03-02 00:53:01,848 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:53:01,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:53:01,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 99 conjunts are in the unsatisfiable core [2022-03-02 00:53:01,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:53:02,702 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-02 00:53:03,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:53:03,687 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-02 00:53:04,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:53:04,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-02 00:53:06,735 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-02 00:53:06,981 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 233 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-02 00:53:06,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:53:10,326 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) is different from false [2022-03-02 00:53:11,160 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) is different from false [2022-03-02 00:53:49,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) is different from false [2022-03-02 00:53:50,379 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) is different from false [2022-03-02 00:53:51,325 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) is different from false [2022-03-02 00:54:04,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-02 00:54:05,437 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 209 refuted. 0 times theorem prover too weak. 57 trivial. 24 not checked. [2022-03-02 00:54:05,437 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897771366] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:54:05,437 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:54:05,437 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39, 36] total 112 [2022-03-02 00:54:05,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046500334] [2022-03-02 00:54:05,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:54:05,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-03-02 00:54:05,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:54:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-03-02 00:54:05,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=377, Invalid=10966, Unknown=19, NotChecked=1070, Total=12432 [2022-03-02 00:54:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:54:05,447 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:54:05,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 9.464285714285714) internal successors, (1060), 112 states have internal predecessors, (1060), 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-03-02 00:54:05,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:54:05,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:05,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:05,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:05,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:54:05,448 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:54:05,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:54:09,872 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:54:10,544 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-02 00:54:11,178 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-02 00:54:11,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-03-02 00:54:13,833 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)))) is different from false [2022-03-02 00:54:17,056 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-02 00:54:17,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:54:18,909 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:54:19,969 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-02 00:54:21,984 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 2) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 2 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-02 00:54:25,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse9 (+ |c_~#arr~0.offset| 8))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse9)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse9)) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:54:26,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:54:27,754 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:54:28,806 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:54:30,813 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ |c_~#arr~0.offset| 12) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:54:35,127 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse9 (+ |c_~#arr~0.offset| 8))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse9)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse9)) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:54:35,825 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:54:36,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:54:38,016 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-02 00:54:40,022 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-02 00:54:57,607 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1318 transitions and produced 1054 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:54:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:54:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2022-03-02 00:54:57,626 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-03-02 00:54:57,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-03-02 00:54:57,810 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:54:57,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:54:57,810 INFO L85 PathProgramCache]: Analyzing trace with hash -43463631, now seen corresponding path program 2 times [2022-03-02 00:54:57,810 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:54:57,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613565731] [2022-03-02 00:54:57,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:54:57,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:54:57,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:54:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 326 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:54:58,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:54:58,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613565731] [2022-03-02 00:54:58,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613565731] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:54:58,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877149129] [2022-03-02 00:54:58,094 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-02 00:54:58,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:54:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:54:58,095 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-03-02 00:54:58,097 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-03-02 00:54:58,335 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-02 00:54:58,335 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:54:58,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-02 00:54:58,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:54:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:54:59,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:54:59,725 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:54:59,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877149129] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:54:59,725 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:54:59,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 25 [2022-03-02 00:54:59,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514833376] [2022-03-02 00:54:59,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:54:59,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-02 00:54:59,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:54:59,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-02 00:54:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-03-02 00:54:59,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:54:59,727 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:54:59,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 25.0) internal successors, (625), 25 states have internal predecessors, (625), 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-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:54:59,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2022-03-02 00:54:59,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:55:00,306 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1346 transitions and produced 1082 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:55:00,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:55:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:55:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:55:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:55:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-02 00:55:00,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-02 00:55:00,324 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-03-02 00:55:00,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-03-02 00:55:00,508 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:55:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:55:00,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1012345829, now seen corresponding path program 3 times [2022-03-02 00:55:00,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:55:00,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261108776] [2022-03-02 00:55:00,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:55:00,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:55:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:55:02,340 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:55:02,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:55:02,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261108776] [2022-03-02 00:55:02,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261108776] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:55:02,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419962718] [2022-03-02 00:55:02,340 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 00:55:02,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:55:02,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:55:02,342 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-03-02 00:55:02,342 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-03-02 00:55:02,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-02 00:55:02,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:55:02,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 117 conjunts are in the unsatisfiable core [2022-03-02 00:55:02,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:55:03,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-02 00:55:04,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:55:04,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-02 00:55:05,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:55:05,446 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-02 00:55:06,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:55:06,450 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 43 [2022-03-02 00:55:09,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 23 [2022-03-02 00:55:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 477 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-02 00:55:09,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:55:13,463 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) is different from false [2022-03-02 00:56:07,814 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) is different from false [2022-03-02 00:56:09,830 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) is different from false [2022-03-02 00:56:43,550 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-02 00:56:44,587 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) is different from false [2022-03-02 00:57:14,511 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-02 00:57:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 446 refuted. 0 times theorem prover too weak. 7 trivial. 31 not checked. [2022-03-02 00:57:15,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1419962718] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:57:15,512 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:57:15,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 43] total 131 [2022-03-02 00:57:15,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140149916] [2022-03-02 00:57:15,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:57:15,514 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-03-02 00:57:15,514 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:57:15,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-03-02 00:57:15,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=460, Invalid=15253, Unknown=57, NotChecked=1260, Total=17030 [2022-03-02 00:57:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:57:15,519 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:57:15,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 9.709923664122137) internal successors, (1272), 131 states have internal predecessors, (1272), 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-03-02 00:57:15,519 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-02 00:57:15,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:57:21,439 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (<= c_~top~0 1) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:57:22,130 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-03-02 00:57:24,134 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 1 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-03-02 00:57:28,994 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse5 (not .cse2)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= c_~top~0 2) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse4 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 00:57:30,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-02 00:57:32,082 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 8 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-02 00:57:38,278 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse4 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse6 (not .cse2)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse4) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse5 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:57:39,535 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:57:41,542 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 12 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:57:48,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse9 (* c_~top~0 4))) (let ((.cse5 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse7 (not .cse2)) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9))) (.cse1 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8)))) (.cse3 (select .cse8 (+ (- 16) |c_~#arr~0.offset| .cse9)))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (< (div .cse3 (- 4294967296)) (+ (div (+ 4 (* (- 1) .cse3)) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse5) (<= 0 .cse6) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse7) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse4) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse7)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse6 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (< .cse3 4294967296)))) is different from false [2022-03-02 00:57:50,017 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-02 00:57:52,023 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 16 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))))))) is different from false [2022-03-02 00:58:22,514 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1433 transitions and produced 1169 states. [2022-03-02 00:58:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:58:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:58:22,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:58:22,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-03-02 00:58:22,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-02 00:58:22,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-03-02 00:58:22,716 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:58:22,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:58:22,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1929867857, now seen corresponding path program 4 times [2022-03-02 00:58:22,717 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:58:22,717 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056479569] [2022-03-02 00:58:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:58:22,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:58:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:58:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:58:24,735 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:58:24,735 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056479569] [2022-03-02 00:58:24,736 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056479569] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:58:24,736 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499805307] [2022-03-02 00:58:24,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-02 00:58:24,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:58:24,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:58:24,737 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:58:24,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-03-02 00:58:25,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-02 00:58:25,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:58:25,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 142 conjunts are in the unsatisfiable core [2022-03-02 00:58:25,056 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:58:25,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-02 00:58:26,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:58:26,178 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-03-02 00:58:26,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:58:26,881 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-02 00:58:27,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:58:27,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-02 00:58:28,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 00:58:28,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-02 00:58:30,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-02 00:58:30,859 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-02 00:58:30,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2022-03-02 00:58:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:58:31,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 00:59:14,334 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-02 00:59:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 29 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 00:59:15,180 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499805307] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 00:59:15,180 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 00:59:15,180 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 54, 56] total 127 [2022-03-02 00:59:15,180 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038995086] [2022-03-02 00:59:15,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 00:59:15,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-03-02 00:59:15,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:59:15,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-03-02 00:59:15,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=15360, Unknown=18, NotChecked=0, Total=16002 [2022-03-02 00:59:15,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:59:15,186 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:59:15,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 7.94488188976378) internal successors, (1009), 127 states have internal predecessors, (1009), 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-03-02 00:59:15,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:59:15,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-03-02 00:59:15,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:59:23,907 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 00:59:24,671 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) .cse2 (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 00:59:25,426 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 00:59:26,194 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 00:59:26,908 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 12 .cse2) (<= 0 .cse0) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 00:59:27,773 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse8 0)) (.cse7 (= (+ c_~top~0 4) 0)) (.cse6 (+ |c_~#arr~0.offset| .cse9)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse5 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse4 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (<= .cse1 4) .cse2 (or .cse3 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse4 (forall ((v_ArrVal_1042 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse2 .cse5 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse6)) .cse7) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9)) 4294967296))) (<= 0 .cse0) (or .cse7 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse9) .cse6) .cse2 .cse5)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse10 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse10) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse10))) 4294967296)))) .cse3) (<= 0 .cse1) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8))) 4294967296))) (or .cse4 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 00:59:31,030 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))))) is different from false [2022-03-02 00:59:32,150 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4))) is different from false [2022-03-02 00:59:33,246 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-02 00:59:34,292 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-02 00:59:35,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= (+ c_~top~0 1) 0)) (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= 0 .cse0) (<= 16 .cse2) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))))) is different from false [2022-03-02 00:59:36,677 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (= (+ c_~top~0 1) 0)) (.cse0 (select .cse5 0)) (.cse10 (= (+ c_~top~0 4) 0)) (.cse9 (+ |c_~#arr~0.offset| .cse6)) (.cse3 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse8 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse4 (= 0 (+ 3 c_~top~0))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (or (forall ((v_ArrVal_1044 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))) .cse1) (<= .cse2 4) .cse3 (or .cse4 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse1 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 12))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse3 .cse8 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse9)) .cse10) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296))) (<= 0 .cse0) (or .cse10 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse6) .cse9) .cse3 .cse8)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse11 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse11) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse11))) 4294967296)))) .cse4) (<= 0 .cse2) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))))) is different from false [2022-03-02 00:59:49,511 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1492 transitions and produced 1228 states. [2022-03-02 00:59:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:59:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2022-03-02 00:59:49,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-03-02 00:59:49,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-03-02 00:59:49,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-03-02 00:59:49,713 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 00:59:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 00:59:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 941435913, now seen corresponding path program 3 times [2022-03-02 00:59:49,713 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 00:59:49,713 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772416120] [2022-03-02 00:59:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 00:59:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 00:59:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 00:59:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 355 proven. 165 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-02 00:59:49,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 00:59:49,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772416120] [2022-03-02 00:59:49,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772416120] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 00:59:49,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028931185] [2022-03-02 00:59:49,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 00:59:49,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 00:59:49,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 00:59:49,953 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 00:59:49,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-02 00:59:50,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-02 00:59:50,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 00:59:50,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-02 00:59:50,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 00:59:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-02 00:59:51,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 00:59:51,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028931185] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 00:59:51,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 00:59:51,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-02 00:59:51,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674661775] [2022-03-02 00:59:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 00:59:51,115 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 00:59:51,115 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 00:59:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 00:59:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-02 00:59:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:59:51,115 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 00:59:51,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 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-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 00:59:51,116 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 103 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 143 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 149 states. [2022-03-02 00:59:51,117 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:00:06,762 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 12)))) (.cse5 (not .cse2)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8)))) (.cse3 (select .cse6 (+ |c_~#arr~0.offset| 8)))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= c_~top~0 5) (< .cse4 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 5 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3)))) is different from false [2022-03-02 01:00:09,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse3 0)) (.cse2 (= (+ c_~top~0 4) 0)) (.cse1 (* c_~top~0 4))) (and (<= .cse0 4) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse2) (<= c_~top~0 5) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse3 (+ (- 16) |c_~#arr~0.offset| .cse1)) 4294967296))) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (<= 0 .cse0) (= |c_~#arr~0.offset| 0) (<= 5 c_~top~0) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_71|))))) (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse2) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse4 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse4 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (not (= 4294967294 (mod (select .cse3 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296)))))) is different from false [2022-03-02 01:00:10,330 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 01:00:12,336 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 (* c_~top~0 4))) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_71|))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0)))) is different from false [2022-03-02 01:00:14,231 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-02 01:00:15,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse8 (* c_~top~0 4)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse4 (select .cse7 4)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse3 (select .cse7 (+ (- 16) |c_~#arr~0.offset| .cse8)))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (< (div .cse3 (- 4294967296)) (+ (div (+ 4 (* (- 1) .cse3)) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (<= c_~top~0 5) (< .cse5 4294967296) (<= .cse4 4) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 5 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (< .cse3 4294967296)))) is different from false [2022-03-02 01:02:48,484 WARN L228 SmtUtils]: Spent 51.22s on a formula simplification that was a NOOP. DAG size: 98 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-03-02 01:02:50,065 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0))) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-02 01:02:51,399 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse2) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-02 01:02:53,361 WARN L838 $PredicateComparison]: unable to prove that (and (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse0 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))) is different from false [2022-03-02 01:02:53,448 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44884 transitions and produced 19721 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:02:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-03-02 01:02:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-03-02 01:02:53,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-02 01:02:53,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-02 01:02:53,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 01:02:53,651 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 01:02:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 01:02:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1842855783, now seen corresponding path program 3 times [2022-03-02 01:02:53,651 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 01:02:53,651 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298229281] [2022-03-02 01:02:53,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 01:02:53,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 01:02:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 01:02:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 371 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 01:02:53,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 01:02:53,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298229281] [2022-03-02 01:02:53,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298229281] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 01:02:53,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036459845] [2022-03-02 01:02:53,814 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-02 01:02:53,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 01:02:53,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 01:02:53,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 01:02:53,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-02 01:02:54,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-02 01:02:54,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 01:02:54,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-02 01:02:54,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 01:02:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 01:02:54,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-02 01:02:54,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036459845] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-02 01:02:54,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-02 01:02:54,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-02 01:02:54,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780358833] [2022-03-02 01:02:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-02 01:02:54,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-02 01:02:54,536 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 01:02:54,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-02 01:02:54,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-02 01:02:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:02:54,536 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 01:02:54,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.153846153846153) internal successors, (288), 13 states have internal predecessors, (288), 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-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-03-02 01:02:54,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:02:59,538 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 118846 transitions and produced 44085 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:02:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2022-03-02 01:02:59,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-02 01:02:59,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-02 01:02:59,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-03-02 01:02:59,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 01:02:59,744 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-02 01:02:59,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-02 01:02:59,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1807273425, now seen corresponding path program 5 times [2022-03-02 01:02:59,745 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-02 01:02:59,745 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573337653] [2022-03-02 01:02:59,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-02 01:02:59,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-02 01:02:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-02 01:03:02,102 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 01:03:02,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-02 01:03:02,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573337653] [2022-03-02 01:03:02,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573337653] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-02 01:03:02,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276927958] [2022-03-02 01:03:02,102 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-02 01:03:02,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 01:03:02,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-02 01:03:02,104 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-02 01:03:02,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-03-02 01:03:02,427 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-03-02 01:03:02,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-02 01:03:02,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 144 conjunts are in the unsatisfiable core [2022-03-02 01:03:02,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-02 01:03:03,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-03-02 01:03:04,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 01:03:04,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-03-02 01:03:06,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 01:03:06,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-03-02 01:03:07,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 01:03:07,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-03-02 01:03:08,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-02 01:03:08,925 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 38 [2022-03-02 01:03:14,422 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2022-03-02 01:03:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 01:03:14,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-02 01:04:01,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-03-02 01:04:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 29 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-02 01:04:02,852 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276927958] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-02 01:04:02,852 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-02 01:04:02,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 55, 56] total 157 [2022-03-02 01:04:02,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003357181] [2022-03-02 01:04:02,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-02 01:04:02,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 157 states [2022-03-02 01:04:02,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-02 01:04:02,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2022-03-02 01:04:02,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=853, Invalid=23618, Unknown=21, NotChecked=0, Total=24492 [2022-03-02 01:04:02,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:04:02,857 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-02 01:04:02,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 157 states, 157 states have (on average 8.980891719745223) internal successors, (1410), 157 states have internal predecessors, (1410), 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-03-02 01:04:02,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:04:02,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:04:02,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:04:02,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 110 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 152 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 162 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-03-02 01:04:02,858 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-02 01:04:13,668 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse6 (select .cse4 |c_~#arr~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_85| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_85| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_85|)))) (= (+ 2 c_~top~0) 0)) (< (div .cse6 (- 4294967296)) (+ (div (+ (* (- 1) .cse6) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (< .cse6 4294967296) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (<= 0 .cse6) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (= (+ (- 1) c_~top~0) 2) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-02 01:04:14,345 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse4 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_85| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_85| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_85|)))) (= (+ 2 c_~top~0) 0)) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (< .cse4 4294967296) .cse2 (<= 0 .cse4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse0 4) (= (+ (- 1) c_~top~0) 2) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 01:04:14,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (< .cse3 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse4 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse4) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296))))) (<= 0 .cse0) (<= 0 .cse3) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (= (+ (- 1) c_~top~0) 2) (<= 3 c_~top~0) (<= c_~top~0 3) (or (= (+ 2 c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0)))))) is different from false [2022-03-02 01:04:15,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (< .cse3 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse4 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse4) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296))))) (<= 0 .cse0) (<= 0 .cse3) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (= (+ (- 1) c_~top~0) 2) (<= 3 c_~top~0) (<= c_~top~0 3) (or (= (+ 2 c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0)))))) is different from false [2022-03-02 01:04:16,272 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|)) (.cse3 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (or (= (+ 2 c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))))) (<= .cse0 4) .cse1 (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (< .cse2 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 12 .cse3) (<= 0 .cse0) (<= 0 .cse2) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= (+ (- 1) c_~top~0) 2) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-02 01:04:17,152 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse6 (= (+ c_~top~0 4) 0)) (.cse5 (+ |c_~#arr~0.offset| .cse8)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse4 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse9 (select .cse7 |c_~#arr~0.offset|)) (.cse0 (= (+ 2 c_~top~0) 0))) (and (or .cse0 (forall ((v_ArrVal_1376 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (<= .cse1 4) .cse2 (or (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) .cse3) (or (and .cse2 .cse4 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse5)) .cse6) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8)) 4294967296))) (or .cse6 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse8) .cse5) .cse2 .cse4)) (< (div .cse9 (- 4294967296)) (+ (div (+ (* (- 1) .cse9) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (< .cse9 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or .cse3 (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse10 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse10) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse10))) 4294967296))))) (<= 0 .cse1) (<= 0 .cse9) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (not (= 4294967294 (mod (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))) 4294967296))) (= (+ (- 1) c_~top~0) 2) (<= 3 c_~top~0) (<= c_~top~0 3) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0))))))) is different from false [2022-03-02 01:04:21,069 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse6 (select .cse4 |c_~#arr~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_85| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_85| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_85|)))) (= (+ 2 c_~top~0) 0)) (< (div .cse6 (- 4294967296)) (+ (div (+ (* (- 1) .cse6) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (< .cse6 4294967296) (<= 4 c_~top~0) (= c_~top~0 4) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (<= 0 .cse6) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_83| Int) (v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_83|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_83| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296)))))) is different from false [2022-03-02 01:04:22,173 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse4 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_85| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_85| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_85|)))) (= (+ 2 c_~top~0) 0)) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (< .cse4 4294967296) (<= 4 c_~top~0) (= c_~top~0 4) .cse2 (<= 0 .cse4) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_83| Int) (v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_83|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_83| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse0 4))) is different from false [2022-03-02 01:04:23,207 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (<= c_~top~0 4) (< .cse3 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (= c_~top~0 4) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse4 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse4) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296))))) (<= 0 .cse0) (<= 0 .cse3) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (or (= (+ 2 c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0)))))) is different from false [2022-03-02 01:04:24,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse3 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (<= c_~top~0 4) (< .cse3 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (= c_~top~0 4) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse4 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse4) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse4))) 4294967296))))) (<= 0 .cse0) (<= 0 .cse3) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (or (= (+ 2 c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0)))))) is different from false [2022-03-02 01:04:25,313 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) |c_~#arr~0.offset|)) (.cse3 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (or (= (+ 2 c_~top~0) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))))) (<= .cse0 4) .cse1 (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (< .cse2 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (= c_~top~0 4) (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))))) (<= 0 .cse0) (<= 0 .cse2) (<= 16 .cse3) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)))) is different from false [2022-03-02 01:04:26,720 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse8 (= (+ c_~top~0 4) 0)) (.cse7 (+ |c_~#arr~0.offset| .cse5)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse6 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse9 (select .cse4 |c_~#arr~0.offset|)) (.cse0 (= (+ 2 c_~top~0) 0))) (and (or .cse0 (forall ((v_ArrVal_1376 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (<= .cse1 4) .cse2 (or (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12))) 4294967296))) (or (and .cse2 .cse6 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse7)) .cse8) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5)) 4294967296))) (or .cse8 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse5) .cse7) .cse2 .cse6)) (< (div .cse9 (- 4294967296)) (+ (div (+ (* (- 1) .cse9) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (or (= (+ c_~top~0 1) 0) (forall ((v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (<= c_~top~0 4) (< .cse9 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (= c_~top~0 4) (or .cse3 (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse10 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse10) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse10))) 4294967296))))) (<= 0 .cse1) (<= 0 .cse9) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))) 4294967296))) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0))))))) is different from false [2022-03-02 01:04:27,917 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (let ((.cse9 (= (+ c_~top~0 4) 0)) (.cse8 (+ |c_~#arr~0.offset| .cse6)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse7 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse4 (= (+ c_~top~0 1) 0)) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse10 (select .cse5 |c_~#arr~0.offset|)) (.cse0 (= (+ 2 c_~top~0) 0))) (and (or .cse0 (forall ((v_ArrVal_1376 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (<= .cse1 4) .cse2 (or (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) .cse3) (or .cse4 (forall ((v_ArrVal_1377 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 12))) 4294967296))) (or (and .cse2 .cse7 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse8)) .cse9) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296))) (or .cse9 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse6) .cse8) .cse2 .cse7)) (< (div .cse10 (- 4294967296)) (+ (div (+ (* (- 1) .cse10) 4) 4294967296) 1)) (= |c_~#arr~0.offset| 0) (or .cse4 (forall ((v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (<= c_~top~0 4) (< .cse10 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (= c_~top~0 4) (or .cse3 (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse11 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse11) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse11))) 4294967296))))) (<= 0 .cse1) (<= 0 .cse10) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))) 4294967296))) (or .cse0 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0))))))) is different from false [2022-03-02 01:05:03,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4)) (.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4))) is different from false [2022-03-02 01:05:04,763 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (or (= 0 (+ 3 c_~top~0)) (forall ((v_ArrVal_1373 Int)) (not (= 4294967294 (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1373)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_122| Int) (v_ArrVal_1376 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_85| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_85| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_122|)) v_ArrVal_1376)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_122| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_85|)))) (= (+ 2 c_~top~0) 0)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_83| Int) (v_ArrVal_1377 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_119| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_83|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_83| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_119|)) v_ArrVal_1377)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_119| c_~top~0)))) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))))) is different from false Received shutdown request... [2022-03-02 01:05:06,559 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-03-02 01:05:06,559 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-02 01:05:06,560 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-03-02 01:05:06,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-03-02 01:05:06,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-02 01:05:06,756 WARN L594 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 230 known predicates. [2022-03-02 01:05:06,758 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 6 remaining) [2022-03-02 01:05:06,758 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 6 remaining) [2022-03-02 01:05:06,758 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-03-02 01:05:06,758 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-02 01:05:06,758 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-02 01:05:06,758 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-02 01:05:06,764 INFO L732 BasicCegarLoop]: Path program histogram: [5, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-03-02 01:05:06,767 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-02 01:05:06,767 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-02 01:05:06,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.03 01:05:06 BasicIcfg [2022-03-02 01:05:06,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-02 01:05:06,769 INFO L158 Benchmark]: Toolchain (without parser) took 820582.51ms. Allocated memory was 178.3MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 120.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 966.2MB. Max. memory is 8.0GB. [2022-03-02 01:05:06,769 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 178.3MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-02 01:05:06,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 536.31ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 120.4MB in the beginning and 212.7MB in the end (delta: -92.2MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-03-02 01:05:06,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.05ms. Allocated memory is still 260.0MB. Free memory was 212.7MB in the beginning and 210.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-02 01:05:06,770 INFO L158 Benchmark]: Boogie Preprocessor took 26.69ms. Allocated memory is still 260.0MB. Free memory was 209.5MB in the beginning and 207.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-02 01:05:06,770 INFO L158 Benchmark]: RCFGBuilder took 407.93ms. Allocated memory is still 260.0MB. Free memory was 207.9MB in the beginning and 191.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-03-02 01:05:06,770 INFO L158 Benchmark]: TraceAbstraction took 819551.70ms. Allocated memory was 260.0MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 191.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 955.3MB. Max. memory is 8.0GB. [2022-03-02 01:05:06,771 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.09ms. Allocated memory is still 178.3MB. Free memory is still 138.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 536.31ms. Allocated memory was 178.3MB in the beginning and 260.0MB in the end (delta: 81.8MB). Free memory was 120.4MB in the beginning and 212.7MB in the end (delta: -92.2MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.05ms. Allocated memory is still 260.0MB. Free memory was 212.7MB in the beginning and 210.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.69ms. Allocated memory is still 260.0MB. Free memory was 209.5MB in the beginning and 207.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 407.93ms. Allocated memory is still 260.0MB. Free memory was 207.9MB in the beginning and 191.7MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 819551.70ms. Allocated memory was 260.0MB in the beginning and 2.5GB in the end (delta: 2.2GB). Free memory was 191.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 955.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 0, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1, Independence queries for same thread: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 1024]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 230 known predicates. - TimeoutResultAtElement [Line: 1023]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 230 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 230 known predicates. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 230 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 294 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 819.4s, OverallIterations: 20, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 439.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 981, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 371.6s InterpolantComputationTime, 10192 NumberOfCodeBlocks, 10149 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 13719 ConstructedInterpolants, 196 QuantifiedInterpolants, 174582 SizeOfPredicates, 407 NumberOfNonLiveVariables, 9610 ConjunctsInSsa, 724 ConjunctsInUnsatCore, 46 InterpolantComputations, 9 PerfectInterpolantSequences, 7567/18497 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