/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-wrwc.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.mcr-reduction-4b0ab11 [2022-03-01 19:14:20,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-01 19:14:20,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-01 19:14:20,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-01 19:14:20,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-01 19:14:20,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-01 19:14:20,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-01 19:14:20,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-01 19:14:20,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-01 19:14:20,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-01 19:14:20,538 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-01 19:14:20,543 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-01 19:14:20,543 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-01 19:14:20,549 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-01 19:14:20,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-01 19:14:20,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-01 19:14:20,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-01 19:14:20,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-01 19:14:20,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-01 19:14:20,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-01 19:14:20,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-01 19:14:20,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-01 19:14:20,572 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-01 19:14:20,572 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-01 19:14:20,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-01 19:14:20,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-01 19:14:20,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-01 19:14:20,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-01 19:14:20,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-01 19:14:20,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-01 19:14:20,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-01 19:14:20,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-01 19:14:20,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-01 19:14:20,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-01 19:14:20,583 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-01 19:14:20,583 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-01 19:14:20,584 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-01 19:14:20,584 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-01 19:14:20,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-01 19:14:20,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-01 19:14:20,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-01 19:14:20,589 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-wrwc.epf [2022-03-01 19:14:20,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-01 19:14:20,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-01 19:14:20,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-01 19:14:20,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-01 19:14:20,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-01 19:14:20,623 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-01 19:14:20,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-01 19:14:20,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-01 19:14:20,623 INFO L138 SettingsManager]: * Use SBE=true [2022-03-01 19:14:20,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-01 19:14:20,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-01 19:14:20,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-01 19:14:20,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-01 19:14:20,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-01 19:14:20,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-01 19:14:20,626 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-01 19:14:20,626 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-01 19:14:20,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-01 19:14:20,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 19:14:20,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-01 19:14:20,627 INFO L138 SettingsManager]: * Construct finite automaton lazily=true [2022-03-01 19:14:20,627 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-01 19:14:20,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-01 19:14:20,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-01 19:14:20,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-01 19:14:20,628 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-01 19:14:20,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2022-03-01 19:14:20,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-01 19:14:20,628 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=MCR_WITH_DEPRANKS [2022-03-01 19:14:20,628 INFO L138 SettingsManager]: * MCR: Overapproximate write-read-write conflicts=false [2022-03-01 19:14:20,628 INFO L138 SettingsManager]: * MCR: Optimize fork and join=false [2022-03-01 19:14:20,628 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-01 19:14:20,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-01 19:14:20,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-01 19:14:20,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-01 19:14:20,849 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-01 19:14:20,851 INFO L275 PluginConnector]: CDTParser initialized [2022-03-01 19:14:20,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-2.i [2022-03-01 19:14:20,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e0ed542/05a9160f1f7c4f1c8074c0c3187b5bdf/FLAG7eda6ce6d [2022-03-01 19:14:21,355 INFO L306 CDTParser]: Found 1 translation units. [2022-03-01 19:14:21,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i [2022-03-01 19:14:21,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e0ed542/05a9160f1f7c4f1c8074c0c3187b5bdf/FLAG7eda6ce6d [2022-03-01 19:14:21,879 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6e0ed542/05a9160f1f7c4f1c8074c0c3187b5bdf [2022-03-01 19:14:21,881 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-01 19:14:21,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-03-01 19:14:21,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-01 19:14:21,883 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-01 19:14:21,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-01 19:14:21,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 07:14:21" (1/1) ... [2022-03-01 19:14:21,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccdef4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:21, skipping insertion in model container [2022-03-01 19:14:21,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.03 07:14:21" (1/1) ... [2022-03-01 19:14:21,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-01 19:14:21,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-01 19:14:22,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-03-01 19:14:22,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 19:14:22,371 INFO L203 MainTranslator]: Completed pre-run [2022-03-01 19:14:22,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-2.i[41520,41533] [2022-03-01 19:14:22,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-01 19:14:22,488 INFO L208 MainTranslator]: Completed translation [2022-03-01 19:14:22,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22 WrapperNode [2022-03-01 19:14:22,488 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-01 19:14:22,489 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-03-01 19:14:22,489 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-03-01 19:14:22,489 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-03-01 19:14:22,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,543 INFO L137 Inliner]: procedures = 277, calls = 46, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 161 [2022-03-01 19:14:22,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-03-01 19:14:22,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-01 19:14:22,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-01 19:14:22,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-01 19:14:22,550 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,554 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,554 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,560 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-01 19:14:22,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-01 19:14:22,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-01 19:14:22,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-01 19:14:22,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (1/1) ... [2022-03-01 19:14:22,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-01 19:14:22,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:22,599 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-01 19:14:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-01 19:14:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2022-03-01 19:14:22,628 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2022-03-01 19:14:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2022-03-01 19:14:22,628 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2022-03-01 19:14:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-03-01 19:14:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-01 19:14:22,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-01 19:14:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-01 19:14:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-03-01 19:14:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-01 19:14:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-01 19:14:22,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-01 19:14:22,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-01 19:14:22,630 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-03-01 19:14:22,725 INFO L234 CfgBuilder]: Building ICFG [2022-03-01 19:14:22,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-01 19:14:22,971 INFO L275 CfgBuilder]: Performing block encoding [2022-03-01 19:14:22,980 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-01 19:14:22,980 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-03-01 19:14:22,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 07:14:22 BoogieIcfgContainer [2022-03-01 19:14:22,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-01 19:14:22,984 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-01 19:14:22,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-01 19:14:22,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-01 19:14:22,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.03 07:14:21" (1/3) ... [2022-03-01 19:14:22,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db7fde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 07:14:22, skipping insertion in model container [2022-03-01 19:14:22,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.03 07:14:22" (2/3) ... [2022-03-01 19:14:22,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db7fde8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.03 07:14:22, skipping insertion in model container [2022-03-01 19:14:22,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.03 07:14:22" (3/3) ... [2022-03-01 19:14:22,990 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-2.i [2022-03-01 19:14:22,994 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-03-01 19:14:22,995 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-01 19:14:22,995 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-03-01 19:14:22,995 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-03-01 19:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,086 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,087 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,092 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,093 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,093 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,093 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-01 19:14:23,093 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,094 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-01 19:14:23,094 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,094 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,094 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-01 19:14:23,094 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,094 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-01 19:14:23,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,095 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,096 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,098 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,099 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,099 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,108 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,109 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,110 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,111 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,112 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,113 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,114 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,115 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,116 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,117 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,121 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,122 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,123 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,124 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,125 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,126 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,127 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,131 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,131 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,131 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,131 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,131 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,132 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,132 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,132 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,134 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,135 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,136 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,137 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,138 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,138 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,138 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,139 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,144 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,145 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,145 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,145 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,147 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,148 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,149 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,150 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,151 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,152 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,153 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,154 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,155 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,155 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,157 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,158 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,159 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,160 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,161 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,162 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,163 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,164 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,166 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,167 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,168 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,169 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,170 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,171 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,173 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,174 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,184 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,185 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,186 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,187 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,188 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,189 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,190 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,191 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,192 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,193 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,194 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,197 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,198 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,198 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,198 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-01 19:14:23,198 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,198 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,198 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,199 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,199 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,209 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,209 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,210 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,211 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,211 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,211 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,211 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,215 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,215 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,215 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,215 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,215 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,216 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret46#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,217 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-03-01 19:14:23,227 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-03-01 19:14:23,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2022-03-01 19:14:23,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:23,285 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-01 19:14:23,287 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-01 19:14:23,315 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-01 19:14:23,324 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=false [2022-03-01 19:14:23,325 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-03-01 19:14:23,442 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-01 19:14:23,463 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-01 19:14:23,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:23,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1174616020, now seen corresponding path program 1 times [2022-03-01 19:14:23,483 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:23,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46141810] [2022-03-01 19:14:23,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:23,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:23,733 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-01 19:14:23,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:23,734 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46141810] [2022-03-01 19:14:23,735 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46141810] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:23,735 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 19:14:23,735 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-03-01 19:14:23,736 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473856365] [2022-03-01 19:14:23,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:23,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-03-01 19:14:23,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:23,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-03-01 19:14:23,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-03-01 19:14:23,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,765 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:23,766 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 41.0) internal successors, (82), 2 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:23,766 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,813 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 132 transitions and produced 133 states. [2022-03-01 19:14:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-01 19:14:23,818 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-01 19:14:23,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:23,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1170051021, now seen corresponding path program 1 times [2022-03-01 19:14:23,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:23,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975136278] [2022-03-01 19:14:23,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:23,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:23,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:23,913 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-01 19:14:23,913 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:23,914 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975136278] [2022-03-01 19:14:23,914 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975136278] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:23,914 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 19:14:23,914 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 19:14:23,914 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149063603] [2022-03-01 19:14:23,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:23,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 19:14:23,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:23,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 19:14:23,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 19:14:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,917 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:23,917 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:23,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,917 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,975 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 158 transitions and produced 124 states. [2022-03-01 19:14:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:23,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:23,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-01 19:14:23,977 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-01 19:14:23,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:23,977 INFO L85 PathProgramCache]: Analyzing trace with hash 323884447, now seen corresponding path program 1 times [2022-03-01 19:14:23,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:23,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861474932] [2022-03-01 19:14:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:24,103 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-01 19:14:24,103 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:24,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861474932] [2022-03-01 19:14:24,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861474932] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:24,104 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 19:14:24,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 19:14:24,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944635336] [2022-03-01 19:14:24,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:24,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 19:14:24,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:24,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 19:14:24,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 19:14:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,106 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:24,106 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:24,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,106 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,147 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 209 transitions and produced 157 states. [2022-03-01 19:14:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,149 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-01 19:14:24,150 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-01 19:14:24,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:24,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2033537427, now seen corresponding path program 1 times [2022-03-01 19:14:24,150 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:24,150 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879877965] [2022-03-01 19:14:24,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:24,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:24,260 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-01 19:14:24,260 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:24,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879877965] [2022-03-01 19:14:24,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879877965] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:24,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 19:14:24,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-01 19:14:24,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583020659] [2022-03-01 19:14:24,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:24,262 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-01 19:14:24,262 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:24,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-01 19:14:24,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-01 19:14:24,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,262 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:24,263 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:24,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,263 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,312 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 235 transitions and produced 183 states. [2022-03-01 19:14:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-01 19:14:24,313 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-01 19:14:24,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:24,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1519561133, now seen corresponding path program 1 times [2022-03-01 19:14:24,315 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:24,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621012073] [2022-03-01 19:14:24,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:24,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:24,379 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-01 19:14:24,380 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:24,380 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621012073] [2022-03-01 19:14:24,380 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621012073] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:24,380 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-01 19:14:24,380 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-03-01 19:14:24,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382863699] [2022-03-01 19:14:24,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:24,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-03-01 19:14:24,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:24,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-03-01 19:14:24,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-03-01 19:14:24,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,382 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:24,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 4 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:24,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,463 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 223 transitions and produced 224 states. [2022-03-01 19:14:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:24,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-01 19:14:24,465 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-01 19:14:24,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:24,466 INFO L85 PathProgramCache]: Analyzing trace with hash -818256019, now seen corresponding path program 1 times [2022-03-01 19:14:24,466 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:24,466 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830644679] [2022-03-01 19:14:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:24,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:24,551 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-01 19:14:24,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:24,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830644679] [2022-03-01 19:14:24,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830644679] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:24,552 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838689127] [2022-03-01 19:14:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:24,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:24,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:24,553 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-01 19:14:24,555 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-01 19:14:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:24,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 19:14:24,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:24,992 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-01 19:14:24,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:14:25,322 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-01 19:14:25,323 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838689127] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:14:25,323 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:14:25,323 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 19:14:25,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051403158] [2022-03-01 19:14:25,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:14:25,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 19:14:25,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:25,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 19:14:25,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 19:14:25,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:25,330 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:25,331 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-01 19:14:25,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:25,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:25,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:25,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:25,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:25,331 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:26,594 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 394 transitions and produced 289 states. [2022-03-01 19:14:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:26,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-01 19:14:26,619 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-01 19:14:26,815 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-01 19:14:26,816 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 19:14:26,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:26,816 INFO L85 PathProgramCache]: Analyzing trace with hash 148992281, now seen corresponding path program 1 times [2022-03-01 19:14:26,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:26,817 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826493419] [2022-03-01 19:14:26,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:26,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:26,935 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-01 19:14:26,935 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:26,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826493419] [2022-03-01 19:14:26,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826493419] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:26,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945852029] [2022-03-01 19:14:26,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:26,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:26,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:26,937 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-01 19:14:26,939 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-01 19:14:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:27,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjunts are in the unsatisfiable core [2022-03-01 19:14:27,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:27,264 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-01 19:14:27,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:14:27,460 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-01 19:14:27,461 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945852029] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:14:27,461 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:14:27,461 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2022-03-01 19:14:27,461 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278059294] [2022-03-01 19:14:27,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:14:27,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-01 19:14:27,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:27,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-01 19:14:27,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-03-01 19:14:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:27,463 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:27,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.9) internal successors, (279), 10 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:27,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:27,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:27,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:27,463 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:27,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:27,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2022-03-01 19:14:27,464 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:30,323 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 687 transitions and produced 529 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:30,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:30,342 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-01 19:14:30,527 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-01 19:14:30,527 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 19:14:30,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1058312109, now seen corresponding path program 2 times [2022-03-01 19:14:30,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:30,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501326225] [2022-03-01 19:14:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:30,700 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:30,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501326225] [2022-03-01 19:14:30,701 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501326225] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:30,701 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155347977] [2022-03-01 19:14:30,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 19:14:30,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:30,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:30,703 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-01 19:14:30,705 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-01 19:14:30,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 19:14:30,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:14:30,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 10 conjunts are in the unsatisfiable core [2022-03-01 19:14:30,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:31,367 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:31,367 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 19:14:31,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155347977] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:31,367 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 19:14:31,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-03-01 19:14:31,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193725581] [2022-03-01 19:14:31,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:31,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-01 19:14:31,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-01 19:14:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-03-01 19:14:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:31,374 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:31,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 19.181818181818183) internal successors, (211), 11 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:31,375 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:34,730 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 715 transitions and produced 557 states. [2022-03-01 19:14:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:34,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:34,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-03-01 19:14:34,942 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-01 19:14:34,942 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-01 19:14:34,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:34,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1593386593, now seen corresponding path program 1 times [2022-03-01 19:14:34,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:34,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232641894] [2022-03-01 19:14:34,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:34,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:35,083 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:35,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:35,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232641894] [2022-03-01 19:14:35,084 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232641894] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:35,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5333286] [2022-03-01 19:14:35,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:35,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:35,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:35,086 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-01 19:14:35,088 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-01 19:14:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:35,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 19:14:35,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:35,638 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:35,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:14:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:36,072 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [5333286] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:14:36,072 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:14:36,072 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-01 19:14:36,072 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549127389] [2022-03-01 19:14:36,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:14:36,073 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 19:14:36,073 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:36,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 19:14:36,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-01 19:14:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:36,074 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:36,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.076923076923077) internal successors, (313), 13 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:36,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:38,073 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 764 transitions and produced 553 states. [2022-03-01 19:14:38,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-01 19:14:38,094 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-01 19:14:38,275 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-01 19:14:38,275 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-01 19:14:38,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1431502631, now seen corresponding path program 2 times [2022-03-01 19:14:38,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:38,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369893033] [2022-03-01 19:14:38,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:38,404 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:38,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369893033] [2022-03-01 19:14:38,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369893033] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:38,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769843130] [2022-03-01 19:14:38,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 19:14:38,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:38,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:38,406 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-01 19:14:38,407 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-01 19:14:38,540 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 19:14:38,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:14:38,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 8 conjunts are in the unsatisfiable core [2022-03-01 19:14:38,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:38,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:14:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 12 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:39,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769843130] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:14:39,286 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:14:39,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-03-01 19:14:39,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259280230] [2022-03-01 19:14:39,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:14:39,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 19:14:39,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:39,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 19:14:39,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2022-03-01 19:14:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:39,288 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:39,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.76923076923077) internal successors, (348), 13 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:39,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:39,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:39,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:39,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:39,288 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:39,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:39,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:39,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:39,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2022-03-01 19:14:39,289 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:43,488 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1085 transitions and produced 821 states. [2022-03-01 19:14:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:43,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:43,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:43,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:43,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-03-01 19:14:43,717 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-01 19:14:43,718 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-01 19:14:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:43,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1603129695, now seen corresponding path program 2 times [2022-03-01 19:14:43,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:43,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840202897] [2022-03-01 19:14:43,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:43,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:44,854 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:44,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840202897] [2022-03-01 19:14:44,854 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840202897] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:44,854 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104450193] [2022-03-01 19:14:44,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 19:14:44,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:44,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:44,857 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-01 19:14:44,858 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-01 19:14:45,051 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 19:14:45,051 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:14:45,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 624 conjuncts, 55 conjunts are in the unsatisfiable core [2022-03-01 19:14:45,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:46,220 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-01 19:14:47,430 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-01 19:14:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2022-03-01 19:14:47,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 19:14:47,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104450193] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:14:47,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 19:14:47,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [32] total 52 [2022-03-01 19:14:47,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92284397] [2022-03-01 19:14:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:14:47,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-03-01 19:14:47,663 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-03-01 19:14:47,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2522, Unknown=0, NotChecked=0, Total=2652 [2022-03-01 19:14:47,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:47,665 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:47,666 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 7.6521739130434785) internal successors, (176), 23 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:47,666 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:57,742 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1144 transitions and produced 880 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:57,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:14:57,775 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-01 19:14:57,968 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-01 19:14:57,969 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-01 19:14:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:14:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash 390942809, now seen corresponding path program 1 times [2022-03-01 19:14:57,970 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:14:57,970 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926587354] [2022-03-01 19:14:57,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:57,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:14:58,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 318 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:58,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:14:58,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926587354] [2022-03-01 19:14:58,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926587354] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:14:58,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115009340] [2022-03-01 19:14:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:14:58,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:14:58,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:14:58,233 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-01 19:14:58,234 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-01 19:14:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:14:58,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 16 conjunts are in the unsatisfiable core [2022-03-01 19:14:58,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:14:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:58,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:14:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 439 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:14:59,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115009340] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:14:59,595 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:14:59,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 27 [2022-03-01 19:14:59,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978117671] [2022-03-01 19:14:59,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:14:59,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-03-01 19:14:59,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:14:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-03-01 19:14:59,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2022-03-01 19:14:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:59,598 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:14:59,598 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 23.62962962962963) internal successors, (638), 27 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:14:59,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:14:59,598 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:14:59,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:15:05,015 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1172 transitions and produced 908 states. [2022-03-01 19:15:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:15:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:15:05,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:15:05,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:15:05,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-03-01 19:15:05,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-03-01 19:15:05,221 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-01 19:15:05,222 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 19:15:05,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:15:05,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1682786829, now seen corresponding path program 1 times [2022-03-01 19:15:05,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:15:05,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555747253] [2022-03-01 19:15:05,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:15:05,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:15:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:15:06,521 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:15:06,521 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:15:06,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555747253] [2022-03-01 19:15:06,521 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555747253] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:15:06,521 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499937094] [2022-03-01 19:15:06,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:15:06,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:15:06,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:15:06,523 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-01 19:15:06,524 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-01 19:15:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:15:06,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 73 conjunts are in the unsatisfiable core [2022-03-01 19:15:06,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:15:07,603 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-01 19:15:08,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:15:08,580 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-01 19:15:10,131 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-01 19:15:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 74 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-03-01 19:15:10,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:15:13,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-01 19:15:47,475 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-01 19:15:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 472 backedges. 248 proven. 73 refuted. 0 times theorem prover too weak. 150 trivial. 1 not checked. [2022-03-01 19:15:48,359 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499937094] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:15:48,359 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:15:48,359 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 30, 29] total 91 [2022-03-01 19:15:48,360 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491170071] [2022-03-01 19:15:48,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:15:48,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-03-01 19:15:48,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:15:48,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-03-01 19:15:48,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=7693, Unknown=20, NotChecked=176, Total=8190 [2022-03-01 19:15:48,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:15:48,364 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:15:48,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 9.31868131868132) internal successors, (848), 91 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:15:48,365 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:15:48,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:15:48,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2022-03-01 19:15:48,366 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:15:55,344 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:16:00,942 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:16:06,607 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 3 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 3) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-01 19:16:11,834 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (+ |c_~#arr~0.offset| 12))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse6)) (.cse4 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse6))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_58| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_58|)) (forall ((v_ArrVal_589 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_58| 4)) v_ArrVal_589)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse5) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= .cse5 4) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-01 19:16:22,903 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1259 transitions and produced 995 states. [2022-03-01 19:16:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:16:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:16:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:16:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:16:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:16:22,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:16:22,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:16:22,921 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-01 19:16:23,104 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-01 19:16:23,105 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-01 19:16:23,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:16:23,105 INFO L85 PathProgramCache]: Analyzing trace with hash -995008903, now seen corresponding path program 2 times [2022-03-01 19:16:23,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:16:23,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047137694] [2022-03-01 19:16:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:16:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:16:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:16:24,732 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:16:24,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:16:24,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047137694] [2022-03-01 19:16:24,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047137694] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:16:24,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971335233] [2022-03-01 19:16:24,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 19:16:24,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:16:24,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:16:24,736 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-01 19:16:24,740 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-01 19:16:24,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 19:16:24,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:16:24,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 768 conjuncts, 99 conjunts are in the unsatisfiable core [2022-03-01 19:16:24,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:16:25,855 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-01 19:16:26,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:16:26,858 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-01 19:16:27,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:16:27,841 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-01 19:16:30,351 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-01 19:16:30,612 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 233 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-03-01 19:16:30,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:16:34,130 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) is different from false [2022-03-01 19:16:35,566 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) is different from false [2022-03-01 19:16:36,648 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) is different from false [2022-03-01 19:16:53,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) is different from false [2022-03-01 19:17:07,583 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) is different from false [2022-03-01 19:17:21,784 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-01 19:17:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 261 proven. 211 refuted. 0 times theorem prover too weak. 57 trivial. 22 not checked. [2022-03-01 19:17:22,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971335233] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:17:22,664 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:17:22,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 39, 36] total 112 [2022-03-01 19:17:22,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73940059] [2022-03-01 19:17:22,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:17:22,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-03-01 19:17:22,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:17:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-03-01 19:17:22,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=10965, Unknown=16, NotChecked=1070, Total=12432 [2022-03-01 19:17:22,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:17:22,670 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:17:22,671 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 9.464285714285714) internal successors, (1060), 112 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:17:22,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:17:22,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:17:27,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) .cse1 (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:17:27,776 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (<= c_~top~0 1) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-01 19:17:30,326 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)))) is different from false [2022-03-01 19:17:34,645 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (not .cse2)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:17:35,797 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:17:36,515 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:17:37,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-01 19:17:39,253 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 2) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 2 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4)))) is different from false [2022-03-01 19:17:43,988 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse5 (not .cse2)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse3) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:17:45,142 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:17:45,832 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:17:46,534 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:17:48,578 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= (+ |c_~#arr~0.offset| 12) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:17:53,594 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4)) (.cse9 (+ |c_~#arr~0.offset| 8))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) .cse9)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse9)) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 .cse3) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:17:54,774 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (<= 0 .cse2) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:17:55,472 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:17:56,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-01 19:17:58,221 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (forall ((v_ArrVal_696 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_64|)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int)) (or (forall ((v_ArrVal_693 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_67|)))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= (+ |c_~#arr~0.offset| 16) (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-01 19:18:19,525 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1318 transitions and produced 1054 states. [2022-03-01 19:18:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:18:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:18:19,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:18:19,543 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-01 19:18:19,726 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-01 19:18:19,727 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 19:18:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:18:19,727 INFO L85 PathProgramCache]: Analyzing trace with hash -43463631, now seen corresponding path program 2 times [2022-03-01 19:18:19,727 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:18:19,727 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390064803] [2022-03-01 19:18:19,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:18:19,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:18:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:18:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 326 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:18:20,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:18:20,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390064803] [2022-03-01 19:18:20,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390064803] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:18:20,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043021529] [2022-03-01 19:18:20,010 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-01 19:18:20,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:18:20,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:18:20,011 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-01 19:18:20,012 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-01 19:18:20,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-01 19:18:20,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:18:20,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 20 conjunts are in the unsatisfiable core [2022-03-01 19:18:20,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:18:20,884 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:18:20,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:18:21,577 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 447 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:18:21,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043021529] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:18:21,577 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:18:21,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 25 [2022-03-01 19:18:21,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045455392] [2022-03-01 19:18:21,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:18:21,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-01 19:18:21,579 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:18:21,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-01 19:18:21,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-03-01 19:18:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:18:21,579 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:18:21,580 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 25.0) internal successors, (625), 25 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:18:21,580 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:18:21,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:18:21,581 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:18:28,576 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1346 transitions and produced 1082 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:18:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:18:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:18:28,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:18:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:18:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:18:28,598 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-01 19:18:28,787 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-01 19:18:28,788 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-01 19:18:28,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:18:28,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1012345829, now seen corresponding path program 3 times [2022-03-01 19:18:28,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:18:28,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572081201] [2022-03-01 19:18:28,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:18:28,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:18:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:18:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:18:30,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:18:30,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572081201] [2022-03-01 19:18:30,636 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572081201] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:18:30,636 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995974474] [2022-03-01 19:18:30,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 19:18:30,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:18:30,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:18:30,637 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-01 19:18:30,638 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-01 19:18:30,940 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-03-01 19:18:30,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:18:30,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 117 conjunts are in the unsatisfiable core [2022-03-01 19:18:30,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:18:31,788 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-01 19:18:32,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:18:32,808 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-01 19:18:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:18:33,798 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-01 19:18:34,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:18:34,806 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-01 19:18:37,940 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-01 19:18:38,216 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 477 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-03-01 19:18:38,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:18:42,158 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) is different from false [2022-03-01 19:18:42,907 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) is different from false [2022-03-01 19:18:43,732 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) is different from false [2022-03-01 19:19:02,162 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) is different from false [2022-03-01 19:19:03,019 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) is different from false [2022-03-01 19:19:43,691 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) is different from false [2022-03-01 19:19:44,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) is different from false [2022-03-01 19:20:10,287 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-01 19:20:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 188 proven. 432 refuted. 0 times theorem prover too weak. 7 trivial. 45 not checked. [2022-03-01 19:20:11,273 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995974474] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:20:11,273 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:20:11,274 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 43] total 131 [2022-03-01 19:20:11,274 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051867242] [2022-03-01 19:20:11,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:20:11,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 131 states [2022-03-01 19:20:11,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:20:11,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2022-03-01 19:20:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=452, Invalid=14809, Unknown=19, NotChecked=1750, Total=17030 [2022-03-01 19:20:11,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:20:11,280 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:20:11,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 131 states, 131 states have (on average 9.709923664122137) internal successors, (1272), 131 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:20:11,281 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:20:11,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:20:11,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 36 states. [2022-03-01 19:20:11,282 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:20:16,959 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse2 (not .cse1)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) .cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967296) 4)) (<= c_~top~0 1) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:20:17,653 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (<= 1 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-03-01 19:20:19,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= c_~top~0 1) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 1 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4))) is different from false [2022-03-01 19:20:24,695 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4)) (.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse5 (not .cse2)) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= c_~top~0 2) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse4 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:20:25,779 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-01 19:20:27,823 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (<= c_~top~0 2) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 2 c_~top~0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 8 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4))))) is different from false [2022-03-01 19:20:33,053 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse4 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse6 (not .cse2)) (.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse3 4) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (< .cse4 4294967296) (<= 0 .cse4) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 .cse3) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse5 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:20:33,878 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (<= 0 .cse2) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse3 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:20:35,591 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:20:37,261 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:20:39,305 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 12 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:20:45,432 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse9 (* c_~top~0 4))) (let ((.cse5 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 12)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse7 (not .cse2)) (.cse6 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9))) (.cse1 (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8)))) (.cse3 (select .cse8 (+ (- 16) |c_~#arr~0.offset| .cse9)))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (< (div .cse3 (- 4294967296)) (+ (div (+ 4 (* (- 1) .cse3)) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse4 4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (< .cse5 4294967296) (<= 0 .cse5) (<= 0 .cse6) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse7) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 .cse4) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse7)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse6 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (< .cse3 4294967296)))) is different from false [2022-03-01 19:20:46,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (<= 0 .cse2) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= c_~top~0 4) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= .cse3 4) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:20:47,867 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:20:49,463 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-01 19:20:51,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4))) (let ((.cse3 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse5))) (.cse1 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= .cse2 4) (< .cse1 4294967296) (< (div .cse3 (- 4294967296)) (+ (div (+ (* (- 1) .cse3) 4) 4294967296) 1)) (< .cse3 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse3) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_~#arr~0.offset| 0) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_95|)) (forall ((v_ArrVal_915 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (<= 4 c_~top~0) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse0 4294967296) (<= 0 .cse2) (<= 16 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (forall ((v_ArrVal_918 Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_92|)))) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_89|)) (forall ((v_ArrVal_919 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))))))) is different from false [2022-03-01 19:21:21,967 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1433 transitions and produced 1169 states. [2022-03-01 19:21:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:21:21,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-01 19:21:21,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-03-01 19:21:22,169 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-01 19:21:22,169 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 19:21:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:21:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1929867857, now seen corresponding path program 4 times [2022-03-01 19:21:22,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:21:22,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945123243] [2022-03-01 19:21:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:21:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:21:22,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:21:24,287 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:21:24,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:21:24,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945123243] [2022-03-01 19:21:24,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945123243] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:21:24,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734242171] [2022-03-01 19:21:24,287 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-01 19:21:24,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:21:24,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:21:24,289 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-01 19:21:24,289 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-01 19:21:24,554 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-01 19:21:24,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:21:24,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 142 conjunts are in the unsatisfiable core [2022-03-01 19:21:24,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:21:25,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-03-01 19:21:25,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:21:25,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-03-01 19:21:26,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:21:26,401 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-01 19:21:27,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:21:27,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-01 19:21:27,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-03-01 19:21:27,987 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-03-01 19:21:30,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-03-01 19:21:30,988 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-03-01 19:21:30,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 13 [2022-03-01 19:21:31,178 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:21:31,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-01 19:22:09,638 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-01 19:22:10,485 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 29 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:22:10,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734242171] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-01 19:22:10,486 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-03-01 19:22:10,486 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 54, 56] total 127 [2022-03-01 19:22:10,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239362873] [2022-03-01 19:22:10,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-03-01 19:22:10,487 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 127 states [2022-03-01 19:22:10,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:22:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2022-03-01 19:22:10,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=15360, Unknown=19, NotChecked=0, Total=16002 [2022-03-01 19:22:10,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:22:10,491 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:22:10,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 127 states, 127 states have (on average 7.94488188976378) internal successors, (1009), 127 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:10,492 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-03-01 19:22:10,493 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:22:22,113 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-01 19:22:22,936 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) .cse2 (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-01 19:22:23,686 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-01 19:22:24,509 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-01 19:22:25,318 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 12 .cse2) (<= 0 .cse0) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 3 c_~top~0) (<= c_~top~0 3))) is different from false [2022-03-01 19:22:26,240 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse9 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse8 0)) (.cse7 (= (+ c_~top~0 4) 0)) (.cse6 (+ |c_~#arr~0.offset| .cse9)) (.cse2 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse5 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse3 (= 0 (+ 3 c_~top~0))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse4 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (<= .cse1 4) .cse2 (or .cse3 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse4 (forall ((v_ArrVal_1042 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse2 .cse5 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse6)) .cse7) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| (- 4) .cse9)) 4294967296))) (<= 0 .cse0) (or .cse7 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse9) .cse6) .cse2 .cse5)) (= |c_~#arr~0.offset| 0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse10 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse10) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse10))) 4294967296)))) .cse3) (<= 0 .cse1) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse8 (+ |c_~#arr~0.offset| .cse9 (- 8))) 4294967296))) (or .cse4 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= 3 c_~top~0) (<= c_~top~0 3)))) is different from false [2022-03-01 19:22:29,567 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse3 (= (+ c_~top~0 4) 0)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0)) (.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse1 (* c_~top~0 4))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1)) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse3) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| (- 4) .cse1)) 4294967296))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse3) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse5 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse5 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse5))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4) (not (= 4294967294 (mod (select .cse4 (+ |c_~#arr~0.offset| .cse1 (- 8))) 4294967296))))) is different from false [2022-03-01 19:22:30,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (or (and (let ((.cse1 (* c_~top~0 4))) (= (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse1))) .cse2 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= 4 c_~top~0) .cse2 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (<= .cse0 4))) is different from false [2022-03-01 19:22:31,895 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-01 19:22:33,010 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= .cse0 4) .cse1 (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse2 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| .cse2))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse3) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (<= 0 .cse0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))))) is different from false [2022-03-01 19:22:34,212 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) (.cse1 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|))) (and (<= .cse0 4) .cse1 (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= (+ c_~top~0 1) 0)) (= |c_~#arr~0.offset| 0) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (not (<= |c_t1Thread1of1ForFork0_get_top_#res#1| |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= 0 .cse0) (<= 16 .cse2) (or (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse2) (+ |c_~#arr~0.offset| (* c_~top~0 4))) .cse1 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_get_top_#res#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296)))) (= 0 (+ 3 c_~top~0))))) is different from false [2022-03-01 19:22:35,520 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_~top~0 4)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse1 (= (+ c_~top~0 1) 0)) (.cse0 (select .cse5 0)) (.cse10 (= (+ c_~top~0 4) 0)) (.cse9 (+ |c_~#arr~0.offset| .cse6)) (.cse3 (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|)) (.cse8 (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296)))) (.cse4 (= 0 (+ 3 c_~top~0))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse7 (= (+ 2 c_~top~0) 0))) (and (<= .cse0 4) (or (forall ((v_ArrVal_1044 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))) .cse1) (<= .cse2 4) .cse3 (or .cse4 (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))))) (or .cse1 (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 12))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (or (and .cse3 .cse8 (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) .cse9)) .cse10) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| (- 4) .cse6)) 4294967296))) (<= 0 .cse0) (or .cse10 (and (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse6) .cse9) .cse3 .cse8)) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse11 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse11) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse11))) 4294967296)))) .cse4) (<= 0 .cse2) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= 4294967294 (mod (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8))) 4294967296))) (or .cse7 (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))))) is different from false [2022-03-01 19:22:56,641 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 1475 transitions and produced 1219 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:22:56,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-01 19:22:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2022-03-01 19:22:56,659 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-01 19:22:56,842 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-01 19:22:56,843 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-01 19:22:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:22:56,843 INFO L85 PathProgramCache]: Analyzing trace with hash 941435913, now seen corresponding path program 3 times [2022-03-01 19:22:56,843 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:22:56,844 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522618499] [2022-03-01 19:22:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:22:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:22:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:22:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 355 proven. 165 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-01 19:22:57,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:22:57,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522618499] [2022-03-01 19:22:57,058 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522618499] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:22:57,058 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496560980] [2022-03-01 19:22:57,058 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 19:22:57,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:22:57,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:22:57,059 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-01 19:22:57,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-03-01 19:22:57,534 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-01 19:22:57,534 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:22:57,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 19:22:57,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:22:58,212 INFO L134 CoverageAnalysis]: Checked inductivity of 955 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-03-01 19:22:58,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 19:22:58,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496560980] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:22:58,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 19:22:58,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-01 19:22:58,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990322212] [2022-03-01 19:22:58,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:22:58,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 19:22:58,214 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:22:58,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 19:22:58,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-01 19:22:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:22:58,214 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:22:58,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.76923076923077) internal successors, (335), 13 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:22:58,215 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 102 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 161 states. [2022-03-01 19:22:58,216 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:25:35,848 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse7 (* c_~top~0 4))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 12)))) (.cse5 (not .cse2)) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| (- 4) .cse7))) (.cse1 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8)))) (.cse3 (select .cse6 (+ |c_~#arr~0.offset| 8)))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (<= .cse3 4) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse4 (- 4294967296)) (+ (div (+ (* (- 1) .cse4) 4) 4294967296) 1)) (<= c_~top~0 5) (< .cse4 4294967296) (<= 0 .cse4) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse5) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 5 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse5)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:25:36,846 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (< (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 5)) (.cse8 (* c_~top~0 4)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse4 (select .cse7 4)) (.cse5 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse6 (not .cse2)) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| (- 4) .cse8))) (.cse1 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse3 (select .cse7 (+ (- 16) |c_~#arr~0.offset| .cse8)))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) .cse2 (< (div .cse3 (- 4294967296)) (+ (div (+ 4 (* (- 1) .cse3)) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= 0 .cse4) (< .cse1 4294967296) (< (div .cse5 (- 4294967296)) (+ (div (+ (* (- 1) .cse5) 4) 4294967296) 1)) (<= c_~top~0 5) (< .cse5 4294967296) (<= .cse4 4) (<= 0 .cse5) (= |c_~#arr~0.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) .cse6) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1))) (<= 5 c_~top~0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)) (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse6)) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (<= 0 .cse3) (< .cse3 4294967296)))) is different from false [2022-03-01 19:25:38,702 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (+ c_~top~0 4) 0)) (.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse0 (* c_~top~0 4))) (and (or (and (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) .cse1) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse0 (- 12))) 4294967296))) (not (= 4294967294 (mod (select .cse2 (+ (- 16) |c_~#arr~0.offset| .cse0)) 4294967296))) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse0)) 4294967296))) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_71|))))) (or (not (= (mod (+ 2 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4294967296) 0)) .cse1) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse3 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse3 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse3))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0))) (not (= 4294967294 (mod (select .cse2 (+ |c_~#arr~0.offset| .cse0 (- 8))) 4294967296))))) is different from false [2022-03-01 19:25:40,200 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_48| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_67| Int) (v_ArrVal_693 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_48| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| 4)) v_ArrVal_693)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_67| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_48|)))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_46| Int) (v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |v_t1Thread1of1ForFork0_push_~stack#1.offset_46|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0)))))) is different from false [2022-03-01 19:25:41,006 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_63| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_63|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_63| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)))) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= 5 |c_~#arr~0.base|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:25:43,011 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 (* c_~top~0 4))) (= (+ .cse0 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_71|))))) (or (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_73| Int)) (or (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_73|)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_73| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0))) (= (+ c_~top~0 1) 0)) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (<= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| |v_t1Thread1of1ForFork0_push_~stack#1.offset_75|)) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))))) (or (forall ((v_ArrVal_1040 Int)) (not (= (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ .cse1 |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296) 4294967294))) (= 0 (+ 3 c_~top~0)))) is different from false [2022-03-01 19:25:44,277 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:25:46,170 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 .cse2) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_#in~x#1|) 4) 4294967296) 1))))) is different from false [2022-03-01 19:25:48,175 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (let ((.cse0 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) (= (+ c_~top~0 4) 0)) (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))))) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))) is different from false [2022-03-01 19:25:49,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse0 (select .cse2 (+ |c_~#arr~0.offset| (- 4) .cse3))) (.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_696 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_64| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_696)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_64| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-01 19:25:51,091 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| (- 4) .cse4))) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (< (div .cse1 (- 4294967296)) (+ (div (+ (* (- 1) .cse1) 4) 4294967296) 1)) (forall ((v_ArrVal_918 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_92| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) v_ArrVal_918)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_92| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< (div .cse2 (- 4294967296)) (+ (div (+ (* (- 1) .cse2) 4) 4294967296) 1)) (< .cse2 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_89| Int) (v_ArrVal_919 Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_89| 4)) v_ArrVal_919)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (forall ((v_ArrVal_915 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_95| Int)) (or (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| 4)) v_ArrVal_915)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) (* c_~top~0 4))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_95| c_~top~0))) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 .cse2) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* (- 1) |c_t1Thread1of1ForFork0_push_~x#1|) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| |c_~#arr~0.offset|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= 5 |c_~#arr~0.base|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* (- 1) .cse0) 4) 4294967296) 1)) (<= 0 .cse1)))) is different from false [2022-03-01 19:25:53,098 WARN L838 $PredicateComparison]: unable to prove that (and (or (= (+ c_~top~0 1) 0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_104| Int) (v_ArrVal_1044 Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_104|)) v_ArrVal_1044)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_104| c_~top~0)))) (or (= c_~top~0 0) (forall ((v_ArrVal_1046 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_101| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_101| c_~top~0) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_101|)) v_ArrVal_1046)) |c_~#arr~0.base|) (+ (- 16) |c_~#arr~0.offset| (* c_~top~0 4))) 4294967296) 4294967294))))) (or (= (+ c_~top~0 4) 0) (and (let ((.cse0 (* c_~top~0 4))) (= (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse0) (+ |c_~#arr~0.offset| .cse0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))))) (or (forall ((v_ArrVal_1040 Int)) (not (= 4294967294 (mod (let ((.cse1 (* c_~top~0 4))) (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| .cse1) v_ArrVal_1040)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 4) .cse1))) 4294967296)))) (= 0 (+ 3 c_~top~0))) (or (= (+ 2 c_~top~0) 0) (forall ((v_ArrVal_1042 Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_107| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_107| c_~top~0) (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* 4 |v_t1Thread1of1ForFork0_push_#t~ret35#1_107|)) v_ArrVal_1042)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))))) is different from false [2022-03-01 19:25:53,317 INFO L104 alCausalityReduction]: MaximalCausalityReduction evaluated 44884 transitions and produced 19793 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:25:53,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2022-03-01 19:25:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2022-03-01 19:25:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:25:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2022-03-01 19:25:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2022-03-01 19:25:53,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-01 19:25:53,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-03-01 19:25:53,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:25:53,519 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-03-01 19:25:53,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-01 19:25:53,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1842855783, now seen corresponding path program 3 times [2022-03-01 19:25:53,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-01 19:25:53,520 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105386411] [2022-03-01 19:25:53,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-01 19:25:53,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-01 19:25:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-01 19:25:53,670 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 371 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:25:53,671 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-01 19:25:53,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105386411] [2022-03-01 19:25:53,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105386411] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-01 19:25:53,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103196209] [2022-03-01 19:25:53,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-03-01 19:25:53,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-01 19:25:53,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-01 19:25:53,672 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-03-01 19:25:53,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-03-01 19:25:53,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-03-01 19:25:53,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-01 19:25:53,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 12 conjunts are in the unsatisfiable core [2022-03-01 19:25:53,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-01 19:25:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-01 19:25:54,309 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-01 19:25:54,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103196209] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-01 19:25:54,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-03-01 19:25:54,310 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2022-03-01 19:25:54,310 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223931909] [2022-03-01 19:25:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-01 19:25:54,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-01 19:25:54,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-01 19:25:54,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-01 19:25:54,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-03-01 19:25:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:25:54,311 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2022-03-01 19:25:54,311 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.153846153846153) internal successors, (288), 13 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-01 19:25:54,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2022-03-01 19:25:54,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:25:54,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:25:54,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2022-03-01 19:25:54,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2022-03-01 19:25:54,311 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 38 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 159 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 180 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2022-03-01 19:25:54,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.