/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_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-c7b2d19 [2022-03-16 07:48:49,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-16 07:48:49,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-16 07:48:49,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-16 07:48:49,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-16 07:48:49,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-16 07:48:49,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-16 07:48:49,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-16 07:48:49,916 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-16 07:48:49,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-16 07:48:49,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-16 07:48:49,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-16 07:48:49,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-16 07:48:49,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-16 07:48:49,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-16 07:48:49,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-16 07:48:49,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-16 07:48:49,925 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-16 07:48:49,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-16 07:48:49,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-16 07:48:49,928 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-16 07:48:49,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-16 07:48:49,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-16 07:48:49,931 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-16 07:48:49,935 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-16 07:48:49,936 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-16 07:48:49,936 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-16 07:48:49,936 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-16 07:48:49,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-16 07:48:49,937 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-16 07:48:49,937 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-16 07:48:49,938 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-16 07:48:49,938 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-16 07:48:49,939 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-16 07:48:49,940 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-16 07:48:49,940 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-16 07:48:49,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-16 07:48:49,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-16 07:48:49,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-16 07:48:49,941 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-16 07:48:49,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-16 07:48:49,942 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-16 07:48:49,965 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-16 07:48:49,965 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-16 07:48:49,965 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-16 07:48:49,965 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-16 07:48:49,966 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-16 07:48:49,966 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-16 07:48:49,966 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-16 07:48:49,966 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-16 07:48:49,967 INFO L138 SettingsManager]: * Use SBE=true [2022-03-16 07:48:49,967 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-16 07:48:49,967 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-16 07:48:49,967 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-16 07:48:49,967 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-16 07:48:49,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-16 07:48:49,968 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-16 07:48:49,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-16 07:48:49,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-16 07:48:49,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-16 07:48:49,969 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-16 07:48:49,970 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-16 07:48:49,970 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-16 07:48:50,145 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-16 07:48:50,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-16 07:48:50,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-16 07:48:50,169 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-16 07:48:50,170 INFO L275 PluginConnector]: CDTParser initialized [2022-03-16 07:48:50,171 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2022-03-16 07:48:50,229 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642691605/7d65262e01eb4619bfc4545249793dc7/FLAGe3129f447 [2022-03-16 07:48:50,645 INFO L306 CDTParser]: Found 1 translation units. [2022-03-16 07:48:50,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2022-03-16 07:48:50,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642691605/7d65262e01eb4619bfc4545249793dc7/FLAGe3129f447 [2022-03-16 07:48:50,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/642691605/7d65262e01eb4619bfc4545249793dc7 [2022-03-16 07:48:50,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-16 07:48:50,679 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-16 07:48:50,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-16 07:48:50,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-16 07:48:50,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-16 07:48:50,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:48:50" (1/1) ... [2022-03-16 07:48:50,685 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4f14f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:50, skipping insertion in model container [2022-03-16 07:48:50,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:48:50" (1/1) ... [2022-03-16 07:48:50,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-16 07:48:50,733 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-16 07:48:51,044 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_longest-2.i[41530,41543] [2022-03-16 07:48:51,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-16 07:48:51,079 INFO L203 MainTranslator]: Completed pre-run [2022-03-16 07:48:51,098 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_longest-2.i[41530,41543] [2022-03-16 07:48:51,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-16 07:48:51,143 INFO L208 MainTranslator]: Completed translation [2022-03-16 07:48:51,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51 WrapperNode [2022-03-16 07:48:51,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-16 07:48:51,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-16 07:48:51,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-16 07:48:51,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-16 07:48:51,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,173 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,197 INFO L137 Inliner]: procedures = 277, calls = 40, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 150 [2022-03-16 07:48:51,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-16 07:48:51,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-16 07:48:51,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-16 07:48:51,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-16 07:48:51,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,235 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,238 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,239 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-16 07:48:51,242 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-16 07:48:51,242 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-16 07:48:51,242 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-16 07:48:51,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (1/1) ... [2022-03-16 07:48:51,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-16 07:48:51,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:51,289 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-16 07:48:51,307 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-16 07:48:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-16 07:48:51,323 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-16 07:48:51,323 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-16 07:48:51,325 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-16 07:48:51,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-16 07:48:51,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-16 07:48:51,326 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-16 07:48:51,471 INFO L234 CfgBuilder]: Building ICFG [2022-03-16 07:48:51,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-16 07:48:51,703 INFO L275 CfgBuilder]: Performing block encoding [2022-03-16 07:48:51,709 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-16 07:48:51,709 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-16 07:48:51,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.03 07:48:51 BoogieIcfgContainer [2022-03-16 07:48:51,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-16 07:48:51,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-16 07:48:51,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-16 07:48:51,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-16 07:48:51,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:48:50" (1/3) ... [2022-03-16 07:48:51,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4313f8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:48:51, skipping insertion in model container [2022-03-16 07:48:51,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:48:51" (2/3) ... [2022-03-16 07:48:51,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4313f8d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:48:51, skipping insertion in model container [2022-03-16 07:48:51,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.03 07:48:51" (3/3) ... [2022-03-16 07:48:51,718 INFO L111 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2022-03-16 07:48:51,722 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-16 07:48:51,722 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-16 07:48:51,722 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-16 07:48:51,722 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-16 07:48:51,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,771 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,772 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,773 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,775 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,776 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,777 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,778 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,779 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,780 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-16 07:48:51,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,780 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-16 07:48:51,780 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,781 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-16 07:48:51,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,781 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-16 07:48:51,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,781 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,782 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,783 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,784 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,785 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,786 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,787 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,788 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,789 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,791 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,794 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,795 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,796 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,797 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,798 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,799 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,800 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,801 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,802 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,803 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,804 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,807 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,808 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,809 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,810 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,811 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,812 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,813 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,814 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,815 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,816 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,817 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,819 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,820 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,820 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,822 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,826 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,827 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,828 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,829 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,830 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,831 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,832 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,832 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,833 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 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-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,837 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,838 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,839 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,841 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,842 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-16 07:48:51,846 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-16 07:48:51,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-16 07:48:51,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:51,891 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-16 07:48:51,892 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-16 07:48:51,911 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-16 07:48:51,915 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-16 07:48:51,916 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-16 07:48:51,956 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-03-16 07:48:51,958 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-16 07:48:51,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1385514707, now seen corresponding path program 1 times [2022-03-16 07:48:51,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:51,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514002201] [2022-03-16 07:48:51,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:52,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,172 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-16 07:48:52,172 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:52,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514002201] [2022-03-16 07:48:52,173 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514002201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:52,173 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 07:48:52,173 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-16 07:48:52,174 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229393523] [2022-03-16 07:48:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:52,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-16 07:48:52,179 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:52,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-16 07:48:52,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-16 07:48:52,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,200 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:52,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 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-16 07:48:52,201 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,227 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 114 transitions and produced 115 states. [2022-03-16 07:48:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-16 07:48:52,228 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-16 07:48:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:52,230 INFO L85 PathProgramCache]: Analyzing trace with hash -692413010, now seen corresponding path program 1 times [2022-03-16 07:48:52,230 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:52,231 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587942927] [2022-03-16 07:48:52,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:52,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,340 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-16 07:48:52,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:52,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587942927] [2022-03-16 07:48:52,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587942927] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:52,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 07:48:52,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-16 07:48:52,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890947143] [2022-03-16 07:48:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:52,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 07:48:52,342 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:52,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 07:48:52,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-16 07:48:52,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,344 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:52,344 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 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-16 07:48:52,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,391 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 140 transitions and produced 113 states. [2022-03-16 07:48:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-16 07:48:52,392 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-16 07:48:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash -783544309, now seen corresponding path program 1 times [2022-03-16 07:48:52,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:52,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562319383] [2022-03-16 07:48:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:52,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,467 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-16 07:48:52,468 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:52,468 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562319383] [2022-03-16 07:48:52,468 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562319383] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:52,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 07:48:52,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-16 07:48:52,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400935620] [2022-03-16 07:48:52,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:52,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 07:48:52,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:52,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 07:48:52,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-16 07:48:52,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,469 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:52,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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-16 07:48:52,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,470 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,508 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 205 transitions and produced 153 states. [2022-03-16 07:48:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-16 07:48:52,510 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-16 07:48:52,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:52,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1126730609, now seen corresponding path program 1 times [2022-03-16 07:48:52,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:52,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307729232] [2022-03-16 07:48:52,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:52,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,592 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-16 07:48:52,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:52,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307729232] [2022-03-16 07:48:52,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307729232] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:52,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 07:48:52,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-16 07:48:52,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75781198] [2022-03-16 07:48:52,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:52,594 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 07:48:52,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:52,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 07:48:52,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-16 07:48:52,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,594 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:52,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-16 07:48:52,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,595 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,612 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 231 transitions and produced 179 states. [2022-03-16 07:48:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-16 07:48:52,613 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-16 07:48:52,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:52,613 INFO L85 PathProgramCache]: Analyzing trace with hash -839370342, now seen corresponding path program 1 times [2022-03-16 07:48:52,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:52,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456586586] [2022-03-16 07:48:52,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:52,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:52,659 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:52,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456586586] [2022-03-16 07:48:52,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456586586] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:52,659 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-16 07:48:52,659 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-16 07:48:52,660 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852502240] [2022-03-16 07:48:52,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:52,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-16 07:48:52,660 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:52,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-16 07:48:52,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-16 07:48:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,661 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:52,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 4 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-16 07:48:52,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,661 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,708 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 203 transitions and produced 204 states. [2022-03-16 07:48:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:52,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-16 07:48:52,710 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-16 07:48:52,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1663540157, now seen corresponding path program 1 times [2022-03-16 07:48:52,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:52,711 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388398907] [2022-03-16 07:48:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,765 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-16 07:48:52,766 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:52,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388398907] [2022-03-16 07:48:52,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388398907] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:48:52,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361068519] [2022-03-16 07:48:52,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:52,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:48:52,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:52,767 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-16 07:48:52,768 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-16 07:48:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:52,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 2 conjunts are in the unsatisfiable core [2022-03-16 07:48:52,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:48:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-03-16 07:48:53,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 07:48:53,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361068519] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:53,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 07:48:53,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-03-16 07:48:53,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684927685] [2022-03-16 07:48:53,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:53,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-16 07:48:53,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:53,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-16 07:48:53,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-03-16 07:48:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,103 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:53,103 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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-16 07:48:53,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,103 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:53,104 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,136 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 231 transitions and produced 232 states. [2022-03-16 07:48:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:53,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-03-16 07:48:53,345 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-16 07:48:53,346 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-16 07:48:53,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash -274763786, now seen corresponding path program 1 times [2022-03-16 07:48:53,347 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:53,347 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697934633] [2022-03-16 07:48:53,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:53,419 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-16 07:48:53,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:53,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697934633] [2022-03-16 07:48:53,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697934633] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:48:53,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421471911] [2022-03-16 07:48:53,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:53,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:48:53,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:53,421 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-16 07:48:53,422 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-16 07:48:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:53,507 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-16 07:48:53,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:48:53,679 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-16 07:48:53,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:48:53,855 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-16 07:48:53,856 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421471911] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:48:53,856 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:48:53,856 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-16 07:48:53,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269404658] [2022-03-16 07:48:53,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:48:53,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-16 07:48:53,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:53,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-16 07:48:53,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-16 07:48:53,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,859 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:53,859 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-16 07:48:53,859 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:53,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,860 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,904 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 388 transitions and produced 283 states. [2022-03-16 07:48:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:53,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-16 07:48:53,926 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-16 07:48:54,126 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-16 07:48:54,126 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-16 07:48:54,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1304490822, now seen corresponding path program 1 times [2022-03-16 07:48:54,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:54,127 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503527072] [2022-03-16 07:48:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:54,232 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-16 07:48:54,233 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:54,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503527072] [2022-03-16 07:48:54,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503527072] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:48:54,233 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406601631] [2022-03-16 07:48:54,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:54,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:48:54,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:54,234 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-16 07:48:54,236 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-16 07:48:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:54,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-16 07:48:54,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:48:54,521 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-16 07:48:54,521 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:48:54,716 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-16 07:48:54,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406601631] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:48:54,716 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:48:54,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-16 07:48:54,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628015740] [2022-03-16 07:48:54,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:48:54,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-16 07:48:54,717 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-16 07:48:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-16 07:48:54,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:54,718 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:54,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.5) internal successors, (265), 10 states have internal predecessors, (265), 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-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-16 07:48:54,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:54,846 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 691 transitions and produced 533 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:48:54,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:48:54,867 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-16 07:48:55,048 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-16 07:48:55,048 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-16 07:48:55,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:55,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1724175136, now seen corresponding path program 2 times [2022-03-16 07:48:55,049 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:55,049 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732661086] [2022-03-16 07:48:55,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:55,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:55,135 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:55,135 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:55,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732661086] [2022-03-16 07:48:55,135 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732661086] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:48:55,135 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001654908] [2022-03-16 07:48:55,135 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 07:48:55,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:48:55,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:55,137 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-16 07:48:55,177 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-16 07:48:55,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-16 07:48:55,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:48:55,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-16 07:48:55,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:48:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:55,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:48:55,881 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:55,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001654908] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:48:55,882 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:48:55,882 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-16 07:48:55,882 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839215221] [2022-03-16 07:48:55,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:48:55,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-16 07:48:55,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:55,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-16 07:48:55,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-16 07:48:55,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:55,883 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:55,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 21.166666666666668) internal successors, (381), 18 states have internal predecessors, (381), 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-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:48:55,884 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:55,968 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 754 transitions and produced 543 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:55,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:48:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:48:55,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-16 07:48:55,987 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-16 07:48:56,175 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-16 07:48:56,175 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-16 07:48:56,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash -474495952, now seen corresponding path program 2 times [2022-03-16 07:48:56,176 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:56,176 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192439103] [2022-03-16 07:48:56,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:56,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:56,281 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:56,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192439103] [2022-03-16 07:48:56,281 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192439103] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:48:56,281 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013499175] [2022-03-16 07:48:56,281 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 07:48:56,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:48:56,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:56,282 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-16 07:48:56,295 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-16 07:48:56,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-16 07:48:56,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:48:56,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-16 07:48:56,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:48:56,663 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:56,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:48:56,988 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:56,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013499175] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:48:56,989 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:48:56,989 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-03-16 07:48:56,989 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292428297] [2022-03-16 07:48:56,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:48:56,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-16 07:48:56,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:56,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-16 07:48:56,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-03-16 07:48:56,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:56,990 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:56,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 24.055555555555557) internal successors, (433), 18 states have internal predecessors, (433), 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-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-16 07:48:56,991 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:57,247 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1423 transitions and produced 1053 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:48:57,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:48:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:48:57,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:48:57,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-03-16 07:48:57,479 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-16 07:48:57,479 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-16 07:48:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:48:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash -597988428, now seen corresponding path program 3 times [2022-03-16 07:48:57,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:48:57,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146089013] [2022-03-16 07:48:57,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:48:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:48:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:48:57,706 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:48:57,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:48:57,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146089013] [2022-03-16 07:48:57,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146089013] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:48:57,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446550403] [2022-03-16 07:48:57,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-16 07:48:57,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:48:57,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:48:57,708 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-16 07:48:57,709 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-16 07:48:57,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-03-16 07:48:57,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:48:57,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-16 07:48:57,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:48:58,725 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-16 07:48:59,512 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-16 07:48:59,788 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 217 proven. 0 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2022-03-16 07:48:59,788 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-16 07:48:59,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446550403] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-16 07:48:59,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-16 07:48:59,789 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [17] total 38 [2022-03-16 07:48:59,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668167761] [2022-03-16 07:48:59,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-16 07:48:59,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-16 07:48:59,789 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:48:59,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-16 07:48:59,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1271, Unknown=0, NotChecked=0, Total=1406 [2022-03-16 07:48:59,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:59,790 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:48:59,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.086956521739131) internal successors, (163), 23 states have internal predecessors, (163), 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-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:48:59,791 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:04,934 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1496 transitions and produced 1126 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:04,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:04,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-03-16 07:49:05,136 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-16 07:49:05,136 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-16 07:49:05,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:49:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash -351793445, now seen corresponding path program 1 times [2022-03-16 07:49:05,137 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:49:05,137 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529082153] [2022-03-16 07:49:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:49:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:49:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:49:05,366 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:05,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:49:05,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529082153] [2022-03-16 07:49:05,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529082153] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:49:05,366 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994802937] [2022-03-16 07:49:05,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:49:05,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:49:05,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:49:05,368 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-16 07:49:05,369 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-16 07:49:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:49:05,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 812 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-16 07:49:05,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:49:06,050 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:06,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:49:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 919 backedges. 0 proven. 889 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:06,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994802937] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:49:06,794 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:49:06,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-16 07:49:06,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581552529] [2022-03-16 07:49:06,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:49:06,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-16 07:49:06,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:49:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-16 07:49:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-16 07:49:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:06,797 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:49:06,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 21.264705882352942) internal successors, (723), 34 states have internal predecessors, (723), 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-16 07:49:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:06,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:06,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:07,032 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1486 transitions and produced 1063 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-03-16 07:49:07,053 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-16 07:49:07,251 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-16 07:49:07,251 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-16 07:49:07,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:49:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1413993724, now seen corresponding path program 3 times [2022-03-16 07:49:07,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:49:07,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151695467] [2022-03-16 07:49:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:49:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:49:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:49:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 28 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:49:07,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:49:07,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151695467] [2022-03-16 07:49:07,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151695467] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:49:07,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270056465] [2022-03-16 07:49:07,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-16 07:49:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:49:07,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:49:07,448 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-16 07:49:07,449 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-16 07:49:07,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-03-16 07:49:07,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:49:07,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-16 07:49:07,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:49:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 28 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:49:08,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:49:08,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1036 backedges. 28 proven. 1008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:49:08,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270056465] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:49:08,879 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:49:08,879 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2022-03-16 07:49:08,879 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60553689] [2022-03-16 07:49:08,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:49:08,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-03-16 07:49:08,880 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:49:08,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-03-16 07:49:08,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2022-03-16 07:49:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:08,881 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:49:08,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 22.61764705882353) internal successors, (769), 34 states have internal predecessors, (769), 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-16 07:49:08,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:08,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:08,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:08,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:08,881 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2022-03-16 07:49:08,882 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:09,727 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2960 transitions and produced 2166 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:09,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:49:09,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:49:09,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-03-16 07:49:09,928 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-16 07:49:09,929 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-16 07:49:09,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:49:09,929 INFO L85 PathProgramCache]: Analyzing trace with hash -130425805, now seen corresponding path program 2 times [2022-03-16 07:49:09,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:49:09,930 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802978132] [2022-03-16 07:49:09,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:49:09,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:49:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:49:10,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4425 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:10,431 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:49:10,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802978132] [2022-03-16 07:49:10,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802978132] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:49:10,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203534740] [2022-03-16 07:49:10,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-16 07:49:10,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:49:10,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:49:10,433 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-16 07:49:10,434 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-16 07:49:10,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-16 07:49:10,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:49:10,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-16 07:49:10,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:49:11,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4425 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:11,661 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:49:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4455 backedges. 0 proven. 4425 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:13,272 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203534740] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:49:13,272 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:49:13,272 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-03-16 07:49:13,272 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720511937] [2022-03-16 07:49:13,272 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:49:13,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-16 07:49:13,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:49:13,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-16 07:49:13,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2022-03-16 07:49:13,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:13,275 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:49:13,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 21.136363636363637) internal successors, (1395), 66 states have internal predecessors, (1395), 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-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:13,276 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:13,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:13,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:13,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:49:13,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:49:13,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:13,951 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 2950 transitions and produced 2103 states. [2022-03-16 07:49:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:49:13,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-03-16 07:49:13,970 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-16 07:49:14,153 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-16 07:49:14,153 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-16 07:49:14,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:49:14,153 INFO L85 PathProgramCache]: Analyzing trace with hash -826667860, now seen corresponding path program 4 times [2022-03-16 07:49:14,154 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:49:14,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985179587] [2022-03-16 07:49:14,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:49:14,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:49:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:49:14,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 60 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:49:14,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:49:14,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985179587] [2022-03-16 07:49:14,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985179587] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:49:14,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344327099] [2022-03-16 07:49:14,678 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-16 07:49:14,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:49:14,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:49:14,679 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-16 07:49:14,698 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-16 07:49:16,144 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-16 07:49:16,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:49:16,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 1334 conjuncts, 32 conjunts are in the unsatisfiable core [2022-03-16 07:49:16,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:49:17,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 60 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:49:17,091 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:49:18,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4740 backedges. 60 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:49:18,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344327099] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:49:18,715 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:49:18,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2022-03-16 07:49:18,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266184792] [2022-03-16 07:49:18,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:49:18,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-03-16 07:49:18,716 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:49:18,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-03-16 07:49:18,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1122, Invalid=3168, Unknown=0, NotChecked=0, Total=4290 [2022-03-16 07:49:18,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:18,718 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:49:18,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 21.833333333333332) internal successors, (1441), 66 states have internal predecessors, (1441), 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-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2022-03-16 07:49:18,719 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:21,441 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5888 transitions and produced 4246 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:49:21,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:49:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-16 07:49:21,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-16 07:49:21,462 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-16 07:49:21,662 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-16 07:49:21,663 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-16 07:49:21,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:49:21,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1588012771, now seen corresponding path program 3 times [2022-03-16 07:49:21,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:49:21,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234976534] [2022-03-16 07:49:21,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:49:21,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:49:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:49:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 19591 backedges. 0 proven. 19561 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-03-16 07:49:23,130 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:49:23,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234976534] [2022-03-16 07:49:23,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234976534] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:49:23,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017008136] [2022-03-16 07:49:23,130 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-16 07:49:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:49:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:49:23,131 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-16 07:49:23,132 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-16 07:49:23,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-03-16 07:49:23,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:49:23,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-16 07:49:23,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:49:25,664 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-16 07:49:26,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-16 07:49:26,546 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-16 07:49:27,841 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-16 07:49:28,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19591 backedges. 2270 proven. 66 refuted. 0 times theorem prover too weak. 17255 trivial. 0 not checked. [2022-03-16 07:49:28,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:49:31,179 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) is different from false [2022-03-16 07:49:32,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) is different from false [2022-03-16 07:50:11,178 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-16 07:50:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19591 backedges. 2270 proven. 60 refuted. 0 times theorem prover too weak. 17255 trivial. 6 not checked. [2022-03-16 07:50:12,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2017008136] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:50:12,800 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:50:12,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 30, 29] total 120 [2022-03-16 07:50:12,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394465120] [2022-03-16 07:50:12,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:50:12,802 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 120 states [2022-03-16 07:50:12,802 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:50:12,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2022-03-16 07:50:12,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=12548, Unknown=5, NotChecked=466, Total=14280 [2022-03-16 07:50:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:50:12,806 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:50:12,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 120 states, 120 states have (on average 15.125) internal successors, (1815), 120 states have internal predecessors, (1815), 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-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-03-16 07:50:12,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:50:17,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse1 (not .cse2)) (.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|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse2)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) .cse2 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1)))) is different from false [2022-03-16 07:50:18,194 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-03-16 07:50:20,212 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 1))) is different from false [2022-03-16 07:50:23,577 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:50:24,402 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:50:26,407 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 2))) is different from false [2022-03-16 07:50:29,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3)))) is different from false [2022-03-16 07:50:29,988 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) is different from false [2022-03-16 07:50:31,994 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) is different from false [2022-03-16 07:50:34,896 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:50:35,739 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:50:37,745 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:50:40,675 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:50:41,437 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:50:43,443 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:50:46,504 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:50:47,233 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_~i~0#1| 6) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:50:49,238 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_~i~0#1| 6) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:50:52,376 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7)))) is different from false [2022-03-16 07:50:53,209 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7))) is different from false [2022-03-16 07:50:55,214 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 7))) is different from false [2022-03-16 07:50:58,261 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 8) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:50:59,079 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_t1Thread1of1ForFork0_~i~0#1| 8) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:01,087 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_t1Thread1of1ForFork0_~i~0#1| 8) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:04,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:05,104 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:07,109 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 9) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:10,291 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:11,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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:13,139 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 10) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:16,256 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:17,016 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:19,021 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 11) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:22,230 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:22,961 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:24,971 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 12))) is different from false [2022-03-16 07:51:28,223 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13)))) is different from false [2022-03-16 07:51:28,960 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13))) is different from false [2022-03-16 07:51:30,966 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 13))) is different from false [2022-03-16 07:51:34,199 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:35,057 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:37,062 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 14) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:40,322 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:41,066 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:43,072 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (<= |c_t1Thread1of1ForFork0_~i~0#1| 15) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:46,440 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16)))) is different from false [2022-03-16 07:51:47,279 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16))) is different from false [2022-03-16 07:51:49,284 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 16))) is different from false [2022-03-16 07:51:52,683 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:53,431 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:51:55,436 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 17) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:51:58,886 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:51:59,743 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:01,748 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 18))) is different from false [2022-03-16 07:52:05,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:06,046 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:08,052 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 19) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:52:11,410 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:12,128 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_t1Thread1of1ForFork0_~i~0#1| 20) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:14,133 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 20) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:52:17,469 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:18,308 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:20,314 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 21) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:52:23,698 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:24,416 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:26,422 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 22))) is different from false [2022-03-16 07:52:29,791 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:30,510 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:32,515 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 23) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:52:36,183 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (<= |c_t1Thread1of1ForFork0_~i~0#1| 24) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:37,050 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_t1Thread1of1ForFork0_~i~0#1| 24) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:39,056 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_t1Thread1of1ForFork0_~i~0#1| 24) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:52:42,738 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:43,493 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:45,503 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 25))) is different from false [2022-03-16 07:52:49,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:50,040 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:52,046 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_~i~0#1| 26) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:52:55,766 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:52:56,623 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:52:58,629 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 27) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:53:02,429 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28)))) is different from false [2022-03-16 07:53:03,191 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28))) is different from false [2022-03-16 07:53:05,197 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 28))) is different from false [2022-03-16 07:53:09,077 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:53:09,924 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_t1Thread1of1ForFork0_~i~0#1| 29) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:53:11,937 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 29) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:53:15,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:53:16,553 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_t1Thread1of1ForFork0_~i~0#1| 30) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:53:18,559 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= |c_t1Thread1of1ForFork0_~i~0#1| 30) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:53:22,449 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse3 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 800))) (let ((.cse2 (not .cse3)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 800) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= |c_t1Thread1of1ForFork0_~i~0#1| 31) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1) .cse3)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div (+ (* (- 1) .cse1) 799) (- 4294967296)) (+ (div .cse1 4294967296) 1)) .cse3 (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0))) (= 5 |c_~#arr~0.base|) (< (div (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0)))))) is different from false [2022-03-16 07:53:23,195 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|) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int) (v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_178| c_~top~0))))) is different from false [2022-03-16 07:53:23,206 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 5878 transitions and produced 4183 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-16 07:53:23,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-16 07:53:23,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 509 states. [2022-03-16 07:53:23,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-03-16 07:53:23,418 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-16 07:53:23,419 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-16 07:53:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:53:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1536024580, now seen corresponding path program 5 times [2022-03-16 07:53:23,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:53:23,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237356377] [2022-03-16 07:53:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:53:23,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:53:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:53:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 124 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:53:25,072 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:53:25,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237356377] [2022-03-16 07:53:25,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237356377] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:53:25,072 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116011405] [2022-03-16 07:53:25,072 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-03-16 07:53:25,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:53:25,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:53:25,073 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-16 07:53:25,074 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-16 07:54:12,344 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-03-16 07:54:12,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-16 07:54:12,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 2566 conjuncts, 64 conjunts are in the unsatisfiable core [2022-03-16 07:54:12,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-16 07:54:14,571 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 124 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:54:14,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-16 07:54:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 20212 backedges. 124 proven. 20088 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-16 07:54:19,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116011405] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-16 07:54:19,131 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-16 07:54:19,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2022-03-16 07:54:19,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671806977] [2022-03-16 07:54:19,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-16 07:54:19,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-03-16 07:54:19,134 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 07:54:19,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-03-16 07:54:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4290, Invalid=12480, Unknown=0, NotChecked=0, Total=16770 [2022-03-16 07:54:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:54:19,138 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 07:54:19,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 130 states have (on average 21.423076923076923) internal successors, (2785), 130 states have internal predecessors, (2785), 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-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:54:19,139 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-03-16 07:54:19,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-03-16 07:54:19,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 509 states. [2022-03-16 07:54:19,140 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:54:23,893 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|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_178| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|)) (forall ((v_ArrVal_1476 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|) (+ (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_178|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_1476)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (< (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) 800) (= |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 (+ (* (- 1) .cse0) 799) (- 4294967296)) (+ (div .cse0 4294967296) 1)))) is different from false [2022-03-16 07:54:33,429 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 6144 transitions and produced 4449 states. [2022-03-16 07:54:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 07:54:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:33,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 544 states. [2022-03-16 07:54:33,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-03-16 07:54:33,463 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-03-16 07:54:33,631 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-16 07:54:33,631 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-16 07:54:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-16 07:54:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2140323423, now seen corresponding path program 4 times [2022-03-16 07:54:33,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-16 07:54:33,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178849396] [2022-03-16 07:54:33,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-16 07:54:33,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-16 07:54:33,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-16 07:54:35,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20959 backedges. 0 proven. 20864 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-03-16 07:54:35,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-16 07:54:35,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178849396] [2022-03-16 07:54:35,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178849396] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-16 07:54:35,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849568541] [2022-03-16 07:54:35,276 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-16 07:54:35,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-16 07:54:35,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-16 07:54:35,277 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-16 07:54:35,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process Received shutdown request... [2022-03-16 08:03:09,168 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-03-16 08:03:09,169 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-16 08:03:09,169 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-16 08:03:10,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-03-16 08:03:10,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2022-03-16 08:03:10,369 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forcibly destroying the process [2022-03-16 08:03:10,423 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-16 08:03:10,423 INFO L191 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-16 08:03:10,423 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2022-03-16 08:03:10,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194516245] [2022-03-16 08:03:10,423 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-03-16 08:03:10,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-03-16 08:03:10,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-16 08:03:10,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-03-16 08:03:10,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 137 [2022-03-16 08:03:10,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2022-03-16 08:03:10,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-16 08:03:10,426 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-16 08:03:10,426 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 21.417910447761194) internal successors, (1435), 67 states have internal predecessors, (1435), 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-16 08:03:10,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 08:03:10,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 08:03:10,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 08:03:10,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 08:03:10,426 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 93 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 94 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 544 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 100 states. [2022-03-16 08:03:10,427 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-16 08:03:10,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-16 08:03:10,428 WARN L594 AbstractCegarLoop]: Verification canceled: while executing DepthFirstTraversal. [2022-03-16 08:03:10,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATION (5 of 6 remaining) [2022-03-16 08:03:10,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATION (4 of 6 remaining) [2022-03-16 08:03:10,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining) [2022-03-16 08:03:10,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2022-03-16 08:03:10,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2022-03-16 08:03:10,430 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-03-16 08:03:10,435 INFO L732 BasicCegarLoop]: Path program histogram: [5, 4, 3, 1, 1, 1, 1, 1, 1] [2022-03-16 08:03:10,437 INFO L230 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-03-16 08:03:10,437 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-16 08:03:10,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 08:03:10 BasicIcfg [2022-03-16 08:03:10,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-16 08:03:10,439 INFO L158 Benchmark]: Toolchain (without parser) took 859759.91ms. Allocated memory was 242.2MB in the beginning and 640.7MB in the end (delta: 398.5MB). Free memory was 190.0MB in the beginning and 256.0MB in the end (delta: -66.0MB). Peak memory consumption was 333.3MB. Max. memory is 8.0GB. [2022-03-16 08:03:10,439 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 242.2MB. Free memory is still 208.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-03-16 08:03:10,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 462.34ms. Allocated memory is still 242.2MB. Free memory was 189.7MB in the beginning and 197.8MB in the end (delta: -8.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-03-16 08:03:10,440 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.16ms. Allocated memory is still 242.2MB. Free memory was 197.8MB in the beginning and 195.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-03-16 08:03:10,440 INFO L158 Benchmark]: Boogie Preprocessor took 42.67ms. Allocated memory is still 242.2MB. Free memory was 195.1MB in the beginning and 193.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-03-16 08:03:10,440 INFO L158 Benchmark]: RCFGBuilder took 468.51ms. Allocated memory is still 242.2MB. Free memory was 193.4MB in the beginning and 177.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-03-16 08:03:10,440 INFO L158 Benchmark]: TraceAbstraction took 858727.10ms. Allocated memory was 242.2MB in the beginning and 640.7MB in the end (delta: 398.5MB). Free memory was 177.3MB in the beginning and 256.0MB in the end (delta: -78.7MB). Peak memory consumption was 320.8MB. Max. memory is 8.0GB. [2022-03-16 08:03:10,441 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.10ms. Allocated memory is still 242.2MB. Free memory is still 208.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 462.34ms. Allocated memory is still 242.2MB. Free memory was 189.7MB in the beginning and 197.8MB in the end (delta: -8.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.16ms. Allocated memory is still 242.2MB. Free memory was 197.8MB in the beginning and 195.1MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.67ms. Allocated memory is still 242.2MB. Free memory was 195.1MB in the beginning and 193.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 468.51ms. Allocated memory is still 242.2MB. Free memory was 193.4MB in the beginning and 177.8MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 858727.10ms. Allocated memory was 242.2MB in the beginning and 640.7MB in the end (delta: 398.5MB). Free memory was 177.3MB in the beginning and 256.0MB in the end (delta: -78.7MB). Peak memory consumption was 320.8MB. 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: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing DepthFirstTraversal. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 272 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 858.5s, OverallIterations: 18, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 215.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 1043, 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, 49.6s SatisfiabilityAnalysisTime, 74.2s InterpolantComputationTime, 14180 NumberOfCodeBlocks, 12710 NumberOfCodeBlocksAsserted, 75 NumberOfCheckSat, 19803 ConstructedInterpolants, 20 QuantifiedInterpolants, 65254 SizeOfPredicates, 233 NumberOfNonLiveVariables, 9238 ConjunctsInSsa, 314 ConjunctsInUnsatCore, 40 InterpolantComputations, 7 PerfectInterpolantSequences, 40929/176630 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