/usr/bin/java -Xmx16000000000 -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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread/stack-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-ba0fd47f62a02cd5486659f03d300faf678a2e90-ba0fd47 [2021-11-13 17:40:28,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-13 17:40:28,567 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-13 17:40:28,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-13 17:40:28,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-13 17:40:28,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-13 17:40:28,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-13 17:40:28,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-13 17:40:28,647 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-13 17:40:28,648 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-13 17:40:28,649 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-13 17:40:28,650 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-13 17:40:28,650 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-13 17:40:28,651 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-13 17:40:28,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-13 17:40:28,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-13 17:40:28,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-13 17:40:28,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-13 17:40:28,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-13 17:40:28,658 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-13 17:40:28,659 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-13 17:40:28,660 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-13 17:40:28,661 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-13 17:40:28,662 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-13 17:40:28,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-13 17:40:28,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-13 17:40:28,665 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-13 17:40:28,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-13 17:40:28,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-13 17:40:28,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-13 17:40:28,667 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-13 17:40:28,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-13 17:40:28,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-13 17:40:28,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-13 17:40:28,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-13 17:40:28,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-13 17:40:28,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-13 17:40:28,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-13 17:40:28,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-13 17:40:28,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-13 17:40:28,672 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-13 17:40:28,672 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-POR-NewStatesSleepPersistentFixedOrder-NoLbe.epf [2021-11-13 17:40:28,693 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-13 17:40:28,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-13 17:40:28,694 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-13 17:40:28,694 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-13 17:40:28,694 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-13 17:40:28,695 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-13 17:40:28,695 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-13 17:40:28,695 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-13 17:40:28,695 INFO L138 SettingsManager]: * Use SBE=true [2021-11-13 17:40:28,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-13 17:40:28,696 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-13 17:40:28,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-13 17:40:28,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:40:28,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2021-11-13 17:40:28,698 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-13 17:40:28,699 INFO L138 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2021-11-13 17:40:28,699 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2021-11-13 17:40:28,699 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 [2021-11-13 17:40:28,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-13 17:40:28,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-13 17:40:28,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-13 17:40:28,890 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-13 17:40:28,891 INFO L275 PluginConnector]: CDTParser initialized [2021-11-13 17:40:28,892 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack-1.i [2021-11-13 17:40:28,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4d633e2/2247af53d0d94ea29afcf11be04eb9a0/FLAG24689606b [2021-11-13 17:40:29,317 INFO L306 CDTParser]: Found 1 translation units. [2021-11-13 17:40:29,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i [2021-11-13 17:40:29,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4d633e2/2247af53d0d94ea29afcf11be04eb9a0/FLAG24689606b [2021-11-13 17:40:29,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc4d633e2/2247af53d0d94ea29afcf11be04eb9a0 [2021-11-13 17:40:29,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-13 17:40:29,678 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-11-13 17:40:29,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-13 17:40:29,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-13 17:40:29,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-13 17:40:29,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:40:29" (1/1) ... [2021-11-13 17:40:29,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76358475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:29, skipping insertion in model container [2021-11-13 17:40:29,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 05:40:29" (1/1) ... [2021-11-13 17:40:29,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-13 17:40:29,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-13 17:40:30,113 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2021-11-13 17:40:30,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:40:30,138 INFO L203 MainTranslator]: Completed pre-run [2021-11-13 17:40:30,187 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack-1.i[41520,41533] [2021-11-13 17:40:30,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-13 17:40:30,250 INFO L208 MainTranslator]: Completed translation [2021-11-13 17:40:30,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30 WrapperNode [2021-11-13 17:40:30,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-13 17:40:30,251 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-13 17:40:30,251 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-13 17:40:30,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-13 17:40:30,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,277 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-13 17:40:30,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-13 17:40:30,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-13 17:40:30,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-13 17:40:30,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-13 17:40:30,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-13 17:40:30,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-13 17:40:30,355 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-13 17:40:30,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (1/1) ... [2021-11-13 17:40:30,370 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-13 17:40:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:30,388 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) [2021-11-13 17:40:30,394 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 [2021-11-13 17:40:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-11-13 17:40:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-11-13 17:40:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-11-13 17:40:30,419 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-11-13 17:40:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-13 17:40:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-13 17:40:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-13 17:40:30,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-13 17:40:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-11-13 17:40:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-13 17:40:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-13 17:40:30,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-13 17:40:30,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-13 17:40:30,421 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-11-13 17:40:30,838 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-13 17:40:30,839 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-11-13 17:40:30,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:40:30 BoogieIcfgContainer [2021-11-13 17:40:30,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-13 17:40:30,841 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-13 17:40:30,841 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-13 17:40:30,844 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-13 17:40:30,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 05:40:29" (1/3) ... [2021-11-13 17:40:30,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:40:30, skipping insertion in model container [2021-11-13 17:40:30,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 05:40:30" (2/3) ... [2021-11-13 17:40:30,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@403094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 05:40:30, skipping insertion in model container [2021-11-13 17:40:30,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 05:40:30" (3/3) ... [2021-11-13 17:40:30,848 INFO L111 eAbstractionObserver]: Analyzing ICFG stack-1.i [2021-11-13 17:40:30,852 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-11-13 17:40:30,852 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-13 17:40:30,852 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-13 17:40:30,852 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-11-13 17:40:30,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,901 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,902 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,903 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,905 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,906 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,907 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,908 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,909 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,910 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,911 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,912 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,913 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,914 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,915 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,916 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,917 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,918 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,919 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,920 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,921 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,922 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,924 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,925 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,926 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,930 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,931 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,932 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,933 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,934 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,935 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,936 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,936 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,936 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,938 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,939 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,940 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,941 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,942 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,942 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,942 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,942 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,942 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,943 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,944 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,945 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,946 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,946 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,946 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,946 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,947 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,947 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,947 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,947 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,947 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,948 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,949 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,950 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,950 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,951 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,953 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,955 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,956 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,957 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,958 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~i~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~ret35#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,961 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~ret42#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~x#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet40#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post39#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,962 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_#t~nondet34#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~tmp~0#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~nondet41#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_push_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_inc_top_#t~post31#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,963 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,964 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,967 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post43#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_get_top_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~nondet36#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,968 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~i~1#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~ret45#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_dec_top_#t~post32#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#res#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~mem38#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,969 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~nondet44#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#t~ret37#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,970 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_pop_#in~stack#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-11-13 17:40:30,975 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-11-13 17:40:31,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-13 17:40:31,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:31,014 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) [2021-11-13 17:40:31,015 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 [2021-11-13 17:40:31,041 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2021-11-13 17:40:31,049 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, 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 [2021-11-13 17:40:31,049 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 17:40:31,214 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:31,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1517659377, now seen corresponding path program 1 times [2021-11-13 17:40:31,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:31,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865574977] [2021-11-13 17:40:31,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:31,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:31,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:31,467 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:31,467 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865574977] [2021-11-13 17:40:31,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865574977] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:31,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:31,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-13 17:40:31,469 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824852318] [2021-11-13 17:40:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:31,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 17:40:31,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:31,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 17:40:31,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 17:40:31,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,496 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:31,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 33.5) internal successors, (67), 2 states have internal predecessors, (67), 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) [2021-11-13 17:40:31,498 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-13 17:40:31,522 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -387529043, now seen corresponding path program 1 times [2021-11-13 17:40:31,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:31,525 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002451890] [2021-11-13 17:40:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:31,525 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:31,670 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:31,671 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002451890] [2021-11-13 17:40:31,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002451890] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:31,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:31,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:40:31,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577822105] [2021-11-13 17:40:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:31,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:40:31,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:31,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:40:31,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:40:31,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,675 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:31,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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) [2021-11-13 17:40:31,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,675 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:31,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-13 17:40:31,751 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:31,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:31,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1019912990, now seen corresponding path program 1 times [2021-11-13 17:40:31,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:31,752 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273216540] [2021-11-13 17:40:31,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:31,752 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:31,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:31,851 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:31,852 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273216540] [2021-11-13 17:40:31,852 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273216540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:31,852 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:31,852 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:40:31,852 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60994787] [2021-11-13 17:40:31,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:31,853 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:40:31,853 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:31,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:40:31,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:40:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,854 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:31,854 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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) [2021-11-13 17:40:31,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:31,854 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:31,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:31,920 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-13 17:40:31,921 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:31,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1559571970, now seen corresponding path program 1 times [2021-11-13 17:40:31,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:31,922 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502206264] [2021-11-13 17:40:31,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:31,922 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:32,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:32,058 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502206264] [2021-11-13 17:40:32,061 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502206264] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:32,062 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312620633] [2021-11-13 17:40:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:32,062 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:32,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:32,064 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) [2021-11-13 17:40:32,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-13 17:40:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:32,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 17:40:32,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:32,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:32,777 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312620633] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:32,777 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:32,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-13 17:40:32,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876692864] [2021-11-13 17:40:32,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:32,778 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 17:40:32,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:32,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 17:40:32,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:40:32,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:32,779 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:32,779 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.6) internal successors, (256), 10 states have internal predecessors, (256), 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) [2021-11-13 17:40:32,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:32,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:32,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:32,780 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:32,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:32,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:32,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:33,079 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,SelfDestructingSolverStorable3 [2021-11-13 17:40:33,079 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:33,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:33,080 INFO L85 PathProgramCache]: Analyzing trace with hash -194388500, now seen corresponding path program 2 times [2021-11-13 17:40:33,080 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:33,080 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115258059] [2021-11-13 17:40:33,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:33,081 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:33,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:33,262 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:33,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115258059] [2021-11-13 17:40:33,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115258059] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:33,262 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828469529] [2021-11-13 17:40:33,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:40:33,263 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:33,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:33,264 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) [2021-11-13 17:40:33,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-11-13 17:40:33,384 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:40:33,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:40:33,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 17:40:33,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:33,854 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:33,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 12 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:34,283 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [828469529] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:34,283 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:34,283 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-13 17:40:34,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154416958] [2021-11-13 17:40:34,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:34,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 17:40:34,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:34,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 17:40:34,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:40:34,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:34,287 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:34,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 24.846153846153847) internal successors, (323), 13 states have internal predecessors, (323), 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) [2021-11-13 17:40:34,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:34,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:34,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:34,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:34,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:34,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:40:34,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:34,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:34,615 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1725244630, now seen corresponding path program 3 times [2021-11-13 17:40:34,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:34,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281417493] [2021-11-13 17:40:34,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:34,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:34,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:34,780 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 365 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:34,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:34,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281417493] [2021-11-13 17:40:34,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281417493] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:34,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280949844] [2021-11-13 17:40:34,780 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 17:40:34,781 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:34,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:34,782 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) [2021-11-13 17:40:34,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-11-13 17:40:34,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-11-13 17:40:34,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:40:34,938 INFO L263 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 17:40:34,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 530 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:35,474 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:40:35,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280949844] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:35,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:40:35,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 15 [2021-11-13 17:40:35,474 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826485633] [2021-11-13 17:40:35,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:35,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 17:40:35,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:35,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 17:40:35,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:40:35,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:35,476 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:35,476 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 21.23076923076923) internal successors, (276), 13 states have internal predecessors, (276), 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) [2021-11-13 17:40:35,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:35,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:35,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:35,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:35,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:40:35,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:36,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:40:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:36,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:36,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:36,227 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:36,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:36,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1642666017, now seen corresponding path program 1 times [2021-11-13 17:40:36,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:36,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281339990] [2021-11-13 17:40:36,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:36,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:36,285 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2021-11-13 17:40:36,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:36,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281339990] [2021-11-13 17:40:36,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281339990] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:36,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:36,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:40:36,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286007822] [2021-11-13 17:40:36,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:36,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:40:36,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:36,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:40:36,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:40:36,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:36,287 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:36,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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) [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:36,287 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:36,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:40:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:36,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:36,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-13 17:40:36,342 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:36,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1325508472, now seen corresponding path program 1 times [2021-11-13 17:40:36,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:36,343 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016189167] [2021-11-13 17:40:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:36,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:36,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 16 proven. 307 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-13 17:40:36,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:36,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016189167] [2021-11-13 17:40:36,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016189167] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:36,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640463700] [2021-11-13 17:40:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:36,485 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:36,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:36,486 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) [2021-11-13 17:40:36,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-11-13 17:40:36,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:36,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 17:40:36,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 16 proven. 307 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-13 17:40:37,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 16 proven. 307 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-11-13 17:40:37,848 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640463700] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:37,848 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:37,848 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2021-11-13 17:40:37,848 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937768651] [2021-11-13 17:40:37,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:37,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-13 17:40:37,849 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:37,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-13 17:40:37,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2021-11-13 17:40:37,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:37,850 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:37,850 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 25.705882352941178) internal successors, (437), 17 states have internal predecessors, (437), 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) [2021-11-13 17:40:37,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:37,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:37,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:37,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:37,850 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:40:37,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:37,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:37,851 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:38,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:40:38,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:38,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:38,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:38,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-11-13 17:40:38,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2021-11-13 17:40:38,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:38,703 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1893319928, now seen corresponding path program 2 times [2021-11-13 17:40:38,704 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:38,704 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053215558] [2021-11-13 17:40:38,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:38,704 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:38,849 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 16 proven. 282 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-13 17:40:38,849 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:38,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053215558] [2021-11-13 17:40:38,850 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053215558] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:38,850 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678032721] [2021-11-13 17:40:38,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:40:38,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:38,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:38,851 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) [2021-11-13 17:40:38,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-11-13 17:40:38,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:40:38,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:40:38,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 12 conjunts are in the unsatisfiable core [2021-11-13 17:40:38,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:39,484 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 16 proven. 282 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-13 17:40:39,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:39,991 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 16 proven. 282 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2021-11-13 17:40:39,991 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678032721] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:39,991 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:39,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 15 [2021-11-13 17:40:39,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117372554] [2021-11-13 17:40:39,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:39,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-11-13 17:40:39,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:39,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-11-13 17:40:39,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-11-13 17:40:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:39,993 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:39,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 27.4) internal successors, (411), 15 states have internal predecessors, (411), 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) [2021-11-13 17:40:39,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:39,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:39,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:39,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:40:39,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:39,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:39,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:39,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2021-11-13 17:40:39,994 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-13 17:40:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-11-13 17:40:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-11-13 17:40:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-13 17:40:40,674 INFO L764 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 17:40:40,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:40,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:40,895 INFO L732 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2021-11-13 17:40:40,896 INFO L308 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork0 was SAFE (1/3) [2021-11-13 17:40:40,898 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-13 17:40:40,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:40,898 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-11-13 17:40:40,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2021-11-13 17:40:40,932 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2021-11-13 17:40:40,932 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, 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 [2021-11-13 17:40:40,932 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-13 17:40:41,001 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION (1 of 2 remaining) [2021-11-13 17:40:41,001 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION (0 of 2 remaining) [2021-11-13 17:40:41,002 INFO L732 BasicCegarLoop]: Path program histogram: [] [2021-11-13 17:40:41,002 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2021-11-13 17:40:41,003 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2021-11-13 17:40:41,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:41,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2021-11-13 17:40:41,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2021-11-13 17:40:41,010 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork1 ======== [2021-11-13 17:40:41,011 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, 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 [2021-11-13 17:40:41,011 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-13 17:40:41,130 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:41,130 INFO L85 PathProgramCache]: Analyzing trace with hash 742735478, now seen corresponding path program 1 times [2021-11-13 17:40:41,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:41,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127371514] [2021-11-13 17:40:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:41,145 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:41,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127371514] [2021-11-13 17:40:41,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127371514] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:41,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:41,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-13 17:40:41,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905508726] [2021-11-13 17:40:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:41,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-11-13 17:40:41,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:41,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-11-13 17:40:41,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-11-13 17:40:41,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,146 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:41,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:40:41,147 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-13 17:40:41,151 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:41,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:41,152 INFO L85 PathProgramCache]: Analyzing trace with hash 773755285, now seen corresponding path program 1 times [2021-11-13 17:40:41,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:41,152 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430461638] [2021-11-13 17:40:41,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:41,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:41,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430461638] [2021-11-13 17:40:41,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430461638] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:41,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:41,184 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:40:41,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950512876] [2021-11-13 17:40:41,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:41,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:40:41,187 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:41,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:40:41,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:40:41,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,188 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:41,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:40:41,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-13 17:40:41,227 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:41,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:41,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1793834916, now seen corresponding path program 1 times [2021-11-13 17:40:41,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:41,227 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931779099] [2021-11-13 17:40:41,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,227 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:41,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:41,260 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931779099] [2021-11-13 17:40:41,260 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931779099] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:41,260 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:41,260 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:40:41,260 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712359040] [2021-11-13 17:40:41,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:41,261 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:40:41,261 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:41,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:40:41,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:40:41,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,261 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:41,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 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) [2021-11-13 17:40:41,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,262 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-13 17:40:41,304 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:41,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1970412771, now seen corresponding path program 1 times [2021-11-13 17:40:41,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:41,305 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658750378] [2021-11-13 17:40:41,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:41,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:41,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658750378] [2021-11-13 17:40:41,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658750378] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:41,333 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:41,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-13 17:40:41,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718556584] [2021-11-13 17:40:41,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:41,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-13 17:40:41,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:41,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-13 17:40:41,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-13 17:40:41,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,334 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:41,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 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) [2021-11-13 17:40:41,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,334 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:41,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-13 17:40:41,357 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:41,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash -500493664, now seen corresponding path program 1 times [2021-11-13 17:40:41,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:41,357 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299791185] [2021-11-13 17:40:41,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:41,399 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:41,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299791185] [2021-11-13 17:40:41,399 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299791185] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:41,399 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132119610] [2021-11-13 17:40:41,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:41,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:41,401 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) [2021-11-13 17:40:41,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2021-11-13 17:40:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-13 17:40:41,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:41,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-11-13 17:40:41,618 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:40:41,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132119610] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:41,619 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:40:41,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-11-13 17:40:41,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582778612] [2021-11-13 17:40:41,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:41,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:40:41,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:41,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:40:41,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-11-13 17:40:41,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,620 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:41,621 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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) [2021-11-13 17:40:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:41,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:41,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:41,867 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,SelfDestructingSolverStorable13 [2021-11-13 17:40:41,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:41,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:41,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1801544941, now seen corresponding path program 1 times [2021-11-13 17:40:41,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:41,869 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036821465] [2021-11-13 17:40:41,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:41,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:41,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036821465] [2021-11-13 17:40:41,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036821465] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:41,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168183237] [2021-11-13 17:40:41,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:41,911 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:41,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:41,912 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) [2021-11-13 17:40:41,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2021-11-13 17:40:41,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:41,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 17:40:41,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:42,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:42,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168183237] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:42,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:42,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-13 17:40:42,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384862768] [2021-11-13 17:40:42,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:42,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 17:40:42,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 17:40:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:40:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,392 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:42,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 21.2) internal successors, (212), 10 states have internal predecessors, (212), 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) [2021-11-13 17:40:42,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:42,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:40:42,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:42,652 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,SelfDestructingSolverStorable14 [2021-11-13 17:40:42,653 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:42,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:42,653 INFO L85 PathProgramCache]: Analyzing trace with hash 836195564, now seen corresponding path program 1 times [2021-11-13 17:40:42,653 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:42,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348009006] [2021-11-13 17:40:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:42,654 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:42,682 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-13 17:40:42,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:42,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348009006] [2021-11-13 17:40:42,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348009006] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:40:42,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-13 17:40:42,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-13 17:40:42,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807584272] [2021-11-13 17:40:42,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:40:42,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-13 17:40:42,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:42,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-13 17:40:42,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-13 17:40:42,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,684 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:42,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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) [2021-11-13 17:40:42,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,684 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:42,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2021-11-13 17:40:42,685 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:42,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-13 17:40:42,746 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash -203510253, now seen corresponding path program 1 times [2021-11-13 17:40:42,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:42,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824488395] [2021-11-13 17:40:42,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:42,747 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:40:42,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:42,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824488395] [2021-11-13 17:40:42,791 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824488395] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:42,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574090099] [2021-11-13 17:40:42,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:42,791 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:42,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:42,792 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) [2021-11-13 17:40:42,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2021-11-13 17:40:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:42,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 4 conjunts are in the unsatisfiable core [2021-11-13 17:40:42,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:40:43,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:43,515 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:40:43,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574090099] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:43,516 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:43,516 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-11-13 17:40:43,516 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836725137] [2021-11-13 17:40:43,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:43,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-11-13 17:40:43,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:43,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-11-13 17:40:43,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-11-13 17:40:43,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:43,517 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:43,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.1) internal successors, (331), 10 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,518 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:43,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:43,891 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,SelfDestructingSolverStorable16 [2021-11-13 17:40:43,891 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:43,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:43,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1672815977, now seen corresponding path program 2 times [2021-11-13 17:40:43,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:43,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826061844] [2021-11-13 17:40:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:43,892 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:43,971 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:43,971 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:43,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826061844] [2021-11-13 17:40:43,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826061844] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:43,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122286190] [2021-11-13 17:40:43,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:40:43,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:43,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:43,973 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) [2021-11-13 17:40:43,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2021-11-13 17:40:44,078 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:40:44,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:40:44,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 17:40:44,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:44,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:44,797 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:44,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122286190] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:44,798 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:44,798 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-13 17:40:44,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472388260] [2021-11-13 17:40:44,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:44,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 17:40:44,799 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 17:40:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:40:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:44,800 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:44,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.76923076923077) internal successors, (296), 13 states have internal predecessors, (296), 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) [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:44,800 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:44,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:40:44,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:45,135 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,SelfDestructingSolverStorable17 [2021-11-13 17:40:45,135 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:45,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:45,136 INFO L85 PathProgramCache]: Analyzing trace with hash 954695913, now seen corresponding path program 2 times [2021-11-13 17:40:45,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:45,136 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600753770] [2021-11-13 17:40:45,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:45,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:45,229 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 130 proven. 180 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:40:45,230 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:45,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600753770] [2021-11-13 17:40:45,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600753770] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:45,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636017443] [2021-11-13 17:40:45,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:40:45,230 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:45,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:45,231 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) [2021-11-13 17:40:45,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2021-11-13 17:40:45,352 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:40:45,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:40:45,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 8 conjunts are in the unsatisfiable core [2021-11-13 17:40:45,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 130 proven. 180 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:40:45,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:40:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 130 proven. 180 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-11-13 17:40:46,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636017443] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:40:46,185 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:40:46,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2021-11-13 17:40:46,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305750363] [2021-11-13 17:40:46,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:40:46,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-11-13 17:40:46,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:40:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-11-13 17:40:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-11-13 17:40:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:46,187 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:40:46,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 30.615384615384617) internal successors, (398), 13 states have internal predecessors, (398), 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) [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:46,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:46,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:40:46,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:46,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:40:46,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:40:46,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2021-11-13 17:40:46,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:46,519 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:40:46,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:40:46,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1480554687, now seen corresponding path program 3 times [2021-11-13 17:40:46,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:40:46,520 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106783404] [2021-11-13 17:40:46,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:40:46,520 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:40:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:40:47,586 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:40:47,587 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:40:47,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106783404] [2021-11-13 17:40:47,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106783404] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:40:47,587 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734389529] [2021-11-13 17:40:47,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 17:40:47,587 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:40:47,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:40:47,588 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) [2021-11-13 17:40:47,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2021-11-13 17:40:47,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-11-13 17:40:47,682 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:40:47,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 50 conjunts are in the unsatisfiable core [2021-11-13 17:40:47,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:40:48,658 INFO L388 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 64 treesize of output 60 [2021-11-13 17:40:49,663 INFO L388 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 [2021-11-13 17:41:54,620 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 145 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2021-11-13 17:41:54,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-11-13 17:41:54,621 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734389529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-13 17:41:54,621 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-11-13 17:41:54,621 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [33] total 53 [2021-11-13 17:41:54,621 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355112455] [2021-11-13 17:41:54,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-13 17:41:54,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2021-11-13 17:41:54,622 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:41:54,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-11-13 17:41:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2596, Unknown=29, NotChecked=0, Total=2756 [2021-11-13 17:41:54,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:41:54,623 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:41:54,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 7.363636363636363) internal successors, (162), 22 states have internal predecessors, (162), 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) [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:41:54,624 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:42:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:42:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:42:12,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2021-11-13 17:42:12,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:42:12,748 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:42:12,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:42:12,748 INFO L85 PathProgramCache]: Analyzing trace with hash 718951796, now seen corresponding path program 1 times [2021-11-13 17:42:12,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:42:12,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749748036] [2021-11-13 17:42:12,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:42:12,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:42:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:42:14,088 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 0 proven. 455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:42:14,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:42:14,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749748036] [2021-11-13 17:42:14,088 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749748036] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:42:14,088 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480352900] [2021-11-13 17:42:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:42:14,088 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:42:14,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:42:14,091 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) [2021-11-13 17:42:14,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-11-13 17:42:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:42:14,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 75 conjunts are in the unsatisfiable core [2021-11-13 17:42:14,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:42:15,106 INFO L388 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 64 treesize of output 60 [2021-11-13 17:42:15,960 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-13 17:42:15,960 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-13 17:42:17,328 INFO L388 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 [2021-11-13 17:42:17,592 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 242 proven. 66 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2021-11-13 17:42:17,592 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:42:20,616 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) is different from false [2021-11-13 17:42:21,352 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) is different from false [2021-11-13 17:42:22,351 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) is different from false [2021-11-13 17:42:41,179 INFO L388 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 [2021-11-13 17:42:42,069 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 242 proven. 57 refuted. 0 times theorem prover too weak. 147 trivial. 9 not checked. [2021-11-13 17:42:42,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480352900] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:42:42,069 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:42:42,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 31, 29] total 92 [2021-11-13 17:42:42,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689986502] [2021-11-13 17:42:42,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:42:42,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2021-11-13 17:42:42,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:42:42,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2021-11-13 17:42:42,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=7537, Unknown=3, NotChecked=528, Total=8372 [2021-11-13 17:42:42,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:42:42,074 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:42:42,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 7.663043478260869) internal successors, (705), 92 states have internal predecessors, (705), 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) [2021-11-13 17:42:42,074 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:42:42,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:42:46,122 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (<= 5 .cse3)) (.cse0 (< .cse3 5))) (and (<= 1 c_~top~0) .cse0 (or (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse1) (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:42:46,810 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))))) is different from false [2021-11-13 17:42:47,476 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:42:48,141 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse0) (<= c_~top~0 1) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:42:50,145 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse0) (<= c_~top~0 1) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0))) is different from false [2021-11-13 17:42:52,965 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (let ((.cse3 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 4)))) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8)))) (.cse2 (<= 5 .cse4)) (.cse1 (< .cse4 5))) (and (<= 0 .cse0) .cse1 (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:42:53,600 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= 2 c_~top~0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))))) is different from false [2021-11-13 17:42:54,252 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 2 c_~top~0) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:42:54,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 c_~top~0) (<= c_~top~0 2) (<= 0 .cse0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:42:56,877 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 c_~top~0) (<= c_~top~0 2) (<= 0 .cse0) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0))) is different from false [2021-11-13 17:42:59,547 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (let ((.cse3 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 4)))) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8)))) (.cse2 (<= 5 .cse4)) (.cse1 (< .cse4 5))) (and (<= 0 .cse0) (<= c_~top~0 3) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* 4294967296 (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 3 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:43:00,131 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= c_~top~0 3) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 3 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))))) is different from false [2021-11-13 17:43:00,708 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 3 c_~top~0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:43:01,267 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 3 c_~top~0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:43:03,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 3) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 3 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 3 c_~top~0) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|))) is different from false [2021-11-13 17:43:05,819 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|)) (.cse7 (+ |c_~#arr~0.offset| 12))) (let ((.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8)))) (.cse4 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse7)) (.cse0 (select (store .cse6 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) .cse7)) (.cse3 (<= 5 .cse8)) (.cse2 (< .cse8 5)) (.cse5 (select .cse6 .cse7))) (and (<= .cse0 4) (<= 0 .cse1) .cse2 (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse4) (< (div .cse1 (- 4294967296)) (+ (div (+ 4 (* .cse1 (- 1))) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= .cse4 4) (<= 4 c_~top~0) (<= .cse5 4) (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1))) (<= 0 .cse5)))) is different from false [2021-11-13 17:43:06,405 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 12)))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= 0 .cse0) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= .cse0 4) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)))) is different from false [2021-11-13 17:43:06,976 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 12)))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse0 4) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)) (<= 0 .cse0))) is different from false [2021-11-13 17:43:07,531 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 12)))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse0 4) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)) (<= 0 .cse0))) is different from false [2021-11-13 17:43:09,535 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 12)))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= (+ |c_~#arr~0.offset| 16) (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= .cse0 4) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (<= 0 .cse0))) is different from false [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:43:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:43:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-11-13 17:43:15,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-11-13 17:43:15,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:43:15,859 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:43:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:43:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -2027629409, now seen corresponding path program 2 times [2021-11-13 17:43:15,859 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:43:15,859 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848268501] [2021-11-13 17:43:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:43:15,860 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:43:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:43:17,446 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:43:17,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:43:17,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848268501] [2021-11-13 17:43:17,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848268501] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:43:17,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1104666056] [2021-11-13 17:43:17,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-11-13 17:43:17,446 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:43:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:43:17,448 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:43:17,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-11-13 17:43:17,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-11-13 17:43:17,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:43:17,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 84 conjunts are in the unsatisfiable core [2021-11-13 17:43:17,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:43:18,332 INFO L388 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 64 treesize of output 60 [2021-11-13 17:43:19,176 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-13 17:43:19,177 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-13 17:43:20,003 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-13 17:43:20,004 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-13 17:43:21,546 INFO L388 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 [2021-11-13 17:43:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 255 proven. 209 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-11-13 17:43:21,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:43:25,104 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| |c_t1Thread1of1ForFork0_get_top_#res#1|))) is different from false [2021-11-13 17:43:25,876 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) is different from false [2021-11-13 17:43:26,710 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) is different from false [2021-11-13 17:43:51,993 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) is different from false [2021-11-13 17:43:57,624 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) is different from false [2021-11-13 17:44:20,820 INFO L388 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 [2021-11-13 17:44:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 255 proven. 187 refuted. 0 times theorem prover too weak. 56 trivial. 22 not checked. [2021-11-13 17:44:21,592 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1104666056] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:44:21,592 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:44:21,592 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 36, 36] total 109 [2021-11-13 17:44:21,592 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368532857] [2021-11-13 17:44:21,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:44:21,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2021-11-13 17:44:21,593 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:44:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2021-11-13 17:44:21,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=10351, Unknown=6, NotChecked=1040, Total=11772 [2021-11-13 17:44:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:44:21,596 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:44:21,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 8.20183486238532) internal successors, (894), 109 states have internal predecessors, (894), 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) [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2021-11-13 17:44:21,597 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:44:25,752 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (<= 5 .cse3)) (.cse0 (< .cse3 5))) (and (<= 1 c_~top~0) .cse0 (or (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse1) (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:44:26,454 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 1 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))) is different from false [2021-11-13 17:44:28,805 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 1 c_~top~0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= 0 .cse0) (<= c_~top~0 1) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0))) is different from false [2021-11-13 17:44:32,123 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4))) (let ((.cse3 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 4)))) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 8)))) (.cse2 (<= 5 .cse4)) (.cse1 (< .cse4 5))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 0 .cse0) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* 4294967296 (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (<= c_~top~0 2) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:44:33,296 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 0 .cse0) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296)))) is different from false [2021-11-13 17:44:33,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse0 4294967296)))) is different from false [2021-11-13 17:44:34,680 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse0 4294967296)))) is different from false [2021-11-13 17:44:36,685 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 2 c_~top~0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= c_~top~0 2) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse0 4294967296) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 2) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= 2 |c_t1Thread1of1ForFork0_get_top_#res#1|)))) is different from false [2021-11-13 17:44:40,578 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (* c_~top~0 4)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|)) (.cse8 (+ |c_~#arr~0.offset| 8))) (let ((.cse0 (select .cse11 .cse8)) (.cse6 (select (store .cse11 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) .cse8)) (.cse5 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 12)))) (.cse1 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 8)))) (.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse8)) (.cse4 (<= 5 .cse7)) (.cse2 (< .cse7 5))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 0 .cse1) (<= c_~top~0 3) .cse2 (<= .cse3 4) (or (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse4 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse5 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse5) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= 0 .cse6) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse1 (- 4294967296)) (+ (div (+ 4 (* .cse1 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= .cse6 4) (< (div .cse5 (- 4294967296)) (+ (div (+ (* .cse5 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 3 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 0 .cse3) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:44:41,666 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8)))) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8)))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 0 .cse0) (<= c_~top~0 3) (<= .cse1 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 3 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 0 .cse1))) is different from false [2021-11-13 17:44:42,261 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (and (<= 0 .cse0) (<= 0 .cse1) (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div .cse1 (- 4294967296)) (+ (div (+ 4 (* .cse1 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse1 4294967296) (<= 3 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296))) is different from false [2021-11-13 17:44:42,873 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (and (<= 0 .cse0) (<= 0 .cse1) (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse1 (- 4294967296)) (+ (div (+ 4 (* .cse1 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse1 4294967296) (<= 3 c_~top~0))) is different from false [2021-11-13 17:44:44,877 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))))) (and (<= 0 .cse0) (<= 0 .cse1) (<= c_~top~0 3) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= (+ |c_~#arr~0.offset| 12) (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse1 (- 4294967296)) (+ (div (+ 4 (* .cse1 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< .cse1 4294967296) (<= 3 c_~top~0) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0))) is different from false [2021-11-13 17:44:49,119 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (* c_~top~0 4)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|)) (.cse8 (+ |c_~#arr~0.offset| 8))) (let ((.cse0 (select .cse11 .cse8)) (.cse6 (select (store .cse11 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) .cse8)) (.cse4 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 4)))) (.cse5 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 12)))) (.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) .cse8)) (.cse3 (<= 5 .cse7)) (.cse1 (< .cse7 5))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) .cse1 (<= .cse2 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse4 4294967296) (< .cse5 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (<= 0 .cse5) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse4 (- 4294967296)) (+ (div (+ (* .cse4 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= 0 .cse6) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= .cse6 4) (<= 0 .cse4) (< (div .cse5 (- 4294967296)) (+ (div (+ (* .cse5 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 4 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 0 .cse2) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:44:50,182 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) (+ |c_~#arr~0.offset| 8)))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse0 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 0 .cse0) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)))) is different from false [2021-11-13 17:44:50,804 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)))) is different from false [2021-11-13 17:44:51,397 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= (+ |c_~#arr~0.offset| 16) (* 4 c_~top~0)))) is different from false [2021-11-13 17:44:53,401 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_~#arr~0.offset| 8))) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (<= 0 .cse0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= (+ |c_~#arr~0.offset| 16) (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (< .cse1 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse0 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0))) is different from false [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:45:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-11-13 17:45:04,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-11-13 17:45:04,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2021-11-13 17:45:04,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-11-13 17:45:04,647 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:45:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:45:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -634360428, now seen corresponding path program 3 times [2021-11-13 17:45:04,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:45:04,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730921651] [2021-11-13 17:45:04,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:45:04,648 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:45:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:45:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 0 proven. 620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:45:06,504 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:45:06,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730921651] [2021-11-13 17:45:06,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730921651] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:45:06,504 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081082016] [2021-11-13 17:45:06,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-11-13 17:45:06,504 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:45:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:45:06,505 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:45:06,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-11-13 17:45:06,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2021-11-13 17:45:06,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:45:06,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 117 conjunts are in the unsatisfiable core [2021-11-13 17:45:06,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:45:07,504 INFO L388 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 64 treesize of output 60 [2021-11-13 17:45:08,343 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-13 17:45:08,343 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-13 17:45:09,152 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-13 17:45:09,152 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-13 17:45:09,968 INFO L354 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2021-11-13 17:45:09,968 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 49 [2021-11-13 17:45:12,306 INFO L388 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 [2021-11-13 17:45:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 184 proven. 429 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-13 17:45:12,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:45:16,164 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))))) is different from false [2021-11-13 17:45:28,653 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) is different from false [2021-11-13 17:45:54,630 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_106| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_106| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_106| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))))) is different from false [2021-11-13 17:47:08,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_109| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_109| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_109| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) is different from false [2021-11-13 17:48:09,654 INFO L388 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 [2021-11-13 17:48:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 184 proven. 414 refuted. 0 times theorem prover too weak. 7 trivial. 15 not checked. [2021-11-13 17:48:10,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081082016] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:48:10,475 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:48:10,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 43] total 132 [2021-11-13 17:48:10,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971068350] [2021-11-13 17:48:10,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:48:10,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2021-11-13 17:48:10,476 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:48:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2021-11-13 17:48:10,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=15721, Unknown=71, NotChecked=1020, Total=17292 [2021-11-13 17:48:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:48:10,480 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:48:10,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 8.204545454545455) internal successors, (1083), 132 states have internal predecessors, (1083), 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) [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2021-11-13 17:48:10,481 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:48:16,727 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296))) (let ((.cse2 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse1 (<= 5 .cse3)) (.cse0 (< .cse3 5))) (and (<= 1 c_~top~0) (or (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_~tmp~0#1| (+ (* 4294967296 (div |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) 4)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= |c_t1Thread1of1ForFork0_push_#in~x#1| 4) (<= |c_t1Thread1of1ForFork0_push_~x#1| 4) (<= 0 .cse2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 1 |c_t1Thread1of1ForFork0_get_top_#res#1|) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_109| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_109| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_109| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse1) (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:48:21,849 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse7 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse5 (select .cse7 4)) (.cse2 (select (store .cse7 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 4)) (.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8)))) (.cse4 (<= 5 .cse6)) (.cse1 (< .cse6 5))) (and (<= 0 .cse0) .cse1 (<= 0 .cse2) (<= .cse3 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse4 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse3) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse5 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 8 (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 2 c_~top~0) (<= 0 .cse5) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse2 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_109| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_109| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_109| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_106| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_106| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_106| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:48:27,048 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (* c_~top~0 4)) (.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse2 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse6 (select .cse8 4)) (.cse4 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 4)))) (.cse5 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 12)))) (.cse1 (select (store .cse8 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 4)) (.cse3 (<= 5 .cse7)) (.cse0 (< .cse7 5))) (and (<= c_~top~0 3) .cse0 (<= 0 .cse1) (<= .cse2 4) (or (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse3 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse2) (< .cse4 4294967296) (< .cse5 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse5) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse4 (- 4294967296)) (+ (div (+ (* .cse4 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse6 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse6) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse4) (< (div .cse5 (- 4294967296)) (+ (div (+ (* .cse5 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse1 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 3 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse3) (and .cse0 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:48:27,778 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12))))) (and (<= c_~top~0 3) (<= .cse0 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse0) (< .cse1 4294967296) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse2) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 3 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-13 17:48:30,457 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse6 (* c_~top~0 4)) (.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse3 (select .cse4 4)) (.cse1 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 4)))) (.cse2 (select .cse5 (+ |c_~#arr~0.offset| .cse6 (- 12)))) (.cse0 (select (store .cse4 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 4))) (and (<= c_~top~0 3) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse2) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse3 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse3) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))))) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse0 4) (<= 12 (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (<= 3 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_109| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_109| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_109| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_106| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_106| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_106| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0)))) is different from false [2021-11-13 17:48:36,732 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse9 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse10 (* c_~top~0 4)) (.cse11 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse3 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse7 (select .cse11 4)) (.cse6 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 4)))) (.cse2 (select (store .cse11 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 4)) (.cse0 (select .cse9 (+ |c_~#arr~0.offset| .cse10 (- 8)))) (.cse5 (select .cse9 (+ |c_~#arr~0.offset| (- 16) .cse10))) (.cse4 (<= 5 .cse8)) (.cse1 (< .cse8 5))) (and (<= 0 .cse0) .cse1 (<= 0 .cse2) (<= .cse3 4) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse4 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse5) (<= 0 .cse3) (< .cse6 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse6 (- 4294967296)) (+ (div (+ (* .cse6 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse7 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< .cse5 4294967296) (<= 0 .cse7) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse6) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse2 4) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 4 c_~top~0) (< (div .cse5 (- 4294967296)) (+ (div (+ (* .cse5 (- 1)) 4) 4294967296) 1)) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse4) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:48:37,376 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 4)) (.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (<= .cse1 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (<= 0 .cse1) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 4 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-13 17:48:40,037 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse5 (* c_~top~0 4)) (.cse6 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse3 (select .cse6 4)) (.cse2 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 4)))) (.cse1 (select (store .cse6 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 4)) (.cse0 (select .cse4 (+ |c_~#arr~0.offset| .cse5 (- 8))))) (and (<= 0 .cse0) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse2 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= c_~top~0 4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= .cse3 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse3) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse2) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294))))) (<= 16 (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|)) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse1 4) (< .cse0 4294967296) (<= 4 c_~top~0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= c_~top~0 |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_109| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_109| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_109| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_106| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_106| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_106| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))))) (= |c_t1Thread1of1ForFork0_get_top_#res#1| c_~top~0)))) is different from false [2021-11-13 17:49:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2021-11-13 17:49:05,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2021-11-13 17:49:05,532 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-11-13 17:49:05,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:49:05,717 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-13 17:49:05,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-13 17:49:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -583088001, now seen corresponding path program 4 times [2021-11-13 17:49:05,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-11-13 17:49:05,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719054674] [2021-11-13 17:49:05,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-13 17:49:05,717 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-13 17:49:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-13 17:49:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 0 proven. 755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:49:07,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-11-13 17:49:07,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719054674] [2021-11-13 17:49:07,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719054674] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-13 17:49:07,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2110022040] [2021-11-13 17:49:07,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-11-13 17:49:07,840 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-13 17:49:07,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-11-13 17:49:07,841 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-13 17:49:07,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-11-13 17:49:08,028 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-11-13 17:49:08,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-11-13 17:49:08,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 128 conjunts are in the unsatisfiable core [2021-11-13 17:49:08,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-13 17:49:08,601 INFO L388 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 18 treesize of output 14 [2021-11-13 17:49:09,299 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-13 17:49:09,300 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-13 17:49:10,067 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-13 17:49:10,067 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-13 17:49:10,782 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-13 17:49:10,783 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-13 17:49:11,531 INFO L354 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2021-11-13 17:49:11,532 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2021-11-13 17:49:13,503 INFO L354 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2021-11-13 17:49:13,505 INFO L388 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 30 treesize of output 19 [2021-11-13 17:49:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 0 proven. 755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-13 17:49:13,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-13 17:49:17,225 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_115| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_115| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 16) (* c_~top~0 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| |c_t1Thread1of1ForFork0_get_top_#res#1|))) is different from false [2021-11-13 17:49:18,203 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_115| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 16) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| c_~top~0))) is different from false [2021-11-13 17:49:56,188 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) is different from false [2021-11-13 17:49:56,932 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) is different from false [2021-11-13 17:49:58,997 WARN L838 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_91| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_91| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| c_~top~0) (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_91| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) is different from false [2021-11-13 17:50:13,386 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| |c_t1Thread1of1ForFork0_get_top_#res#1|))) is different from false [2021-11-13 17:51:01,502 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) is different from false [2021-11-13 17:51:21,788 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) is different from false [2021-11-13 17:51:30,656 INFO L388 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 [2021-11-13 17:51:31,365 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 29 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 66 not checked. [2021-11-13 17:51:31,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2110022040] provided 0 perfect and 2 imperfect interpolant sequences [2021-11-13 17:51:31,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-11-13 17:51:31,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 50] total 121 [2021-11-13 17:51:31,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536933349] [2021-11-13 17:51:31,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-11-13 17:51:31,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2021-11-13 17:51:31,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-11-13 17:51:31,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2021-11-13 17:51:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=427, Invalid=12191, Unknown=70, NotChecked=1832, Total=14520 [2021-11-13 17:51:31,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:51:31,371 INFO L470 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2021-11-13 17:51:31,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 7.619834710743802) internal successors, (922), 121 states have internal predecessors, (922), 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) [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 118 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 133 states. [2021-11-13 17:51:31,372 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2021-11-13 17:51:34,704 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 0 (mod (+ (* (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967295) 4294967294) (- 4294967296)))) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-13 17:51:35,374 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= c_~top~0 1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (<= 4 (* 4 c_~top~0)))) is different from false [2021-11-13 17:51:37,629 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse2 (* 4 c_~top~0)) (.cse1 (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= c_~top~0 1) (<= 4 .cse1) (<= .cse0 4) (<= 4 .cse2) (= (+ |c_~#arr~0.offset| .cse2) (+ .cse1 |c_t1Thread1of1ForFork0_push_~stack#1.offset|)))) is different from false [2021-11-13 17:51:39,035 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 2 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse0 4))) is different from false [2021-11-13 17:51:40,337 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= 2 c_~top~0) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (not (= 0 (mod (+ (* (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967295) 4294967294) (- 4294967296)))))) is different from false [2021-11-13 17:51:41,009 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= 2 c_~top~0) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|))) is different from false [2021-11-13 17:51:41,610 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (<= 2 c_~top~0) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse0) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= .cse0 4))) is different from false [2021-11-13 17:51:43,613 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (= |c_~#arr~0.offset| 0) (<= 2 c_~top~0) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 2) (<= .cse0 4) (<= 2 |c_t1Thread1of1ForFork0_get_top_#res#1|) (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)))) is different from false [2021-11-13 17:51:44,537 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse0 (select (store .cse3 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse2 (select .cse3 0))) (and (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (<= .cse0 4) (<= .cse1 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= 2 c_~top~0) (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse2) (<= c_~top~0 2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 .cse1) (<= .cse2 4)))) is different from false [2021-11-13 17:51:47,377 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (<= c_~top~0 3) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| c_~top~0) (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_93| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_91| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_91| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| c_~top~0) (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_91| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (<= 3 c_~top~0) (not (= 0 (mod (+ (* (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967295) 4294967294) (- 4294967296)))))) is different from false [2021-11-13 17:51:48,933 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (<= c_~top~0 3) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| c_~top~0) (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_93| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_91| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_91| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| c_~top~0) (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_91| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (<= 3 c_~top~0))) is different from false [2021-11-13 17:51:50,419 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 3 c_~top~0) (<= .cse0 4))) is different from false [2021-11-13 17:51:51,827 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 3 c_~top~0) (<= .cse0 4))) is different from false [2021-11-13 17:51:53,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (<= c_~top~0 3) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (= |c_~#arr~0.offset| 0) (<= |c_t1Thread1of1ForFork0_get_top_#res#1| 3) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (<= 3 |c_t1Thread1of1ForFork0_get_top_#res#1|) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 3 c_~top~0) (<= .cse0 4) (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)))) is different from false [2021-11-13 17:51:55,115 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|))) (let ((.cse0 (select (store .cse3 (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |c_t1Thread1of1ForFork0_push_~x#1|) 0)) (.cse1 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse2 (select .cse3 0))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (<= c_~top~0 3) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= 0 .cse0) (<= .cse0 4) (<= .cse1 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (<= 0 .cse2) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 .cse1) (<= 3 c_~top~0) (<= .cse2 4)))) is different from false [2021-11-13 17:51:58,255 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (not (= 4294967294 (mod (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| c_~top~0) (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_93| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (<= 4 c_~top~0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_91| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_91| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| c_~top~0) (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_91| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (not (= 0 (mod (+ (* (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967295) 4294967294) (- 4294967296)))))) is different from false [2021-11-13 17:51:59,783 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_#in~stack#1.base|) 0))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.offset| 0) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| c_~top~0) (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_93| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (<= 4 c_~top~0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_91| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_91| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| c_~top~0) (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_91| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))))) is different from false [2021-11-13 17:52:01,554 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_115| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 16) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| c_~top~0))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= .cse0 4))) is different from false [2021-11-13 17:52:03,534 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_115| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (not (= 4294967294 (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 16) (* c_~top~0 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| c_~top~0))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= .cse0 4))) is different from false [2021-11-13 17:52:05,538 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0)) (.cse1 (* 4 |c_t1Thread1of1ForFork0_get_top_#res#1|))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296)))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| |c_t1Thread1of1ForFork0_get_top_#res#1|) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))))) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_115| Int)) (or (forall ((|t1Thread1of1ForFork0_push_~x#1| 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_115| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 16) (* c_~top~0 4))) 4294967296)))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| |c_t1Thread1of1ForFork0_get_top_#res#1|))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (<= 0 .cse0) (<= 16 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 4 c_~top~0) (<= .cse0 4) (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ .cse1 |c_t1Thread1of1ForFork0_push_~stack#1.offset|)))) is different from false [2021-11-13 17:52:06,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) 0)) (.cse1 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) 0))) (and (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| 0) (<= c_~top~0 4) (<= .cse0 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= c_~top~0 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (= (+ |c_~#arr~0.offset| (* 4 c_~top~0)) (+ (* 4 |c_t1Thread1of1ForFork0_push_#t~ret35#1|) |c_t1Thread1of1ForFork0_push_~stack#1.offset|)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))) (not (= 4294967294 (mod |c_t1Thread1of1ForFork0_push_~x#1| 4294967296))) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int)) (not (= (mod (select (select (store |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_push_~stack#1.base|) (+ |c_t1Thread1of1ForFork0_push_~stack#1.offset| (* |c_t1Thread1of1ForFork0_push_#t~ret35#1| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294))) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_~stack#1.offset| 0) (<= 0 .cse0) (forall ((|t1Thread1of1ForFork0_push_~x#1| 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)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296)))) (<= 4 c_~top~0) (<= .cse1 4))) is different from false [2021-11-13 17:52:19,517 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse5 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse3 (select .cse5 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4)))) (.cse0 (select .cse5 (+ |c_~#arr~0.offset| 12))) (.cse2 (<= 5 .cse4)) (.cse1 (< .cse4 5))) (and (<= 0 .cse0) .cse1 (<= 5 c_~top~0) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 5) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse0 4) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:52:20,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse7 (* c_~top~0 4)) (.cse6 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse4 (select .cse6 (+ |c_~#arr~0.offset| 8))) (.cse3 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 4)))) (.cse0 (select .cse6 (+ |c_~#arr~0.offset| .cse7 (- 8)))) (.cse2 (<= 5 .cse5)) (.cse1 (< .cse5 5))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 0 .cse0) .cse1 (<= 5 c_~top~0) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 5) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (<= .cse4 4) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (<= 0 .cse4) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse3) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:52:21,531 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296)) (.cse7 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse8 (* c_~top~0 4))) (let ((.cse3 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 4)))) (.cse4 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 12)))) (.cse0 (select .cse7 (+ |c_~#arr~0.offset| .cse8 (- 8)))) (.cse5 (select .cse7 4)) (.cse2 (<= 5 .cse6)) (.cse1 (< .cse6 5))) (and (<= 0 .cse0) .cse1 (<= 5 c_~top~0) (or (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 1)) (and .cse2 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0))) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse3 4294967296) (< .cse4 4294967296) (= |c_~#arr~0.offset| 0) (<= 0 |c_t1Thread1of1ForFork0_push_~x#1|) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse4) (< (div |c_t1Thread1of1ForFork0_push_~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_~x#1| (- 1)) 4) 4294967296) 1)) (<= c_~top~0 5) (< (div .cse3 (- 4294967296)) (+ (div (+ (* .cse3 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= .cse5 4) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< |c_t1Thread1of1ForFork0_push_~x#1| 4294967296) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse3) (< (div .cse4 (- 4294967296)) (+ (div (+ (* .cse4 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (<= 0 .cse5) (or (and (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 0) .cse2) (and .cse1 (= |c_t1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1| 1)))))) is different from false [2021-11-13 17:52:23,406 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#arr~0.base|))) (let ((.cse0 (select .cse1 0))) (and (<= 5 c_~top~0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (= |c_~#arr~0.offset| 0) (<= c_~top~0 5) (<= .cse0 4) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_124| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_95| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_95| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_95| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_124| c_~top~0))) (not (= (mod |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) 4294967294)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_115| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_89| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| c_~top~0) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_89| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (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_89| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_115| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (- 16) (* c_~top~0 4))) 4294967296) 4294967294)))) (not (= 4294967294 (mod (select .cse1 (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_121| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_93| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_93| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| c_~top~0) (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_93| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_121| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)))) (<= 0 .cse0) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_118| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_91| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_91| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| c_~top~0) (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_91| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_118| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296))))) (not (= 0 (mod (+ (* (mod |c_t1Thread1of1ForFork0_~tmp~0#1| 4294967296) 4294967295) 4294967294) (- 4294967296))))))) is different from false [2021-11-13 17:52:24,024 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_71| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| c_~top~0) (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_71| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_71| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))))) is different from false [2021-11-13 17:52:25,227 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_75| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| c_~top~0) (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_75| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_75| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_~stack#1.offset_77| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_97| Int)) (or (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_77| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| c_~top~0) (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_77| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_97| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296) 4294967294)))) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-13 17:52:25,987 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse4 (* c_~top~0 4))) (let ((.cse1 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 4)))) (.cse2 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 12)))) (.cse0 (select .cse3 (+ |c_~#arr~0.offset| .cse4 (- 8))))) (and (<= 0 .cse0) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< .cse1 4294967296) (< .cse2 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (<= 0 .cse2) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_103| Int) (|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_~stack#1.offset_81| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| c_~top~0) (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_81| (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_103| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 12))) 4294967296) 4294967294)) (< |v_t1Thread1of1ForFork0_push_~stack#1.offset_81| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|))) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_#in~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (< (div .cse2 (- 4294967296)) (+ (div (+ (* .cse2 (- 1)) 4) 4294967296) 1)) (= |c_t1Thread1of1ForFork0_push_#in~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false [2021-11-13 17:53:43,117 WARN L227 SmtUtils]: Spent 22.69s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-11-13 17:53:43,751 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))))) (and (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse0 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse0 (- 4294967296)) (+ (div (+ (* .cse0 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse0) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296) (forall ((|t1Thread1of1ForFork0_push_~x#1| Int) (|v_t1Thread1of1ForFork0_push_#t~ret35#1_88| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 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|) (+ (* |v_t1Thread1of1ForFork0_push_#t~ret35#1_88| 4) |c_t1Thread1of1ForFork0_push_~stack#1.offset|) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 4))) 4294967296))))))) is different from false [2021-11-13 17:53:44,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#arr~0.base|)) (.cse3 (* c_~top~0 4))) (let ((.cse1 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 4)))) (.cse0 (select .cse2 (+ |c_~#arr~0.offset| .cse3 (- 8))))) (and (<= 0 .cse0) (= |c_t1Thread1of1ForFork0_push_~stack#1.base| |c_~#arr~0.base|) (< .cse1 4294967296) (<= 0 |c_t1Thread1of1ForFork0_push_#in~x#1|) (< (div .cse1 (- 4294967296)) (+ (div (+ (* .cse1 (- 1)) 4) 4294967296) 1)) (= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (<= |c_~#arr~0.offset| |c_t1Thread1of1ForFork0_push_~stack#1.offset|) (< (div .cse0 (- 4294967296)) (+ (div (+ 4 (* .cse0 (- 1))) 4294967296) 1)) (forall ((|v_t1Thread1of1ForFork0_push_#t~ret35#1_94| Int) (|t1Thread1of1ForFork0_push_~x#1| Int)) (or (< |v_t1Thread1of1ForFork0_push_#t~ret35#1_94| 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_94| 4)) |t1Thread1of1ForFork0_push_~x#1|)) |c_~#arr~0.base|) (+ |c_~#arr~0.offset| (* c_~top~0 4) (- 8))) 4294967296))))) (< (div |c_t1Thread1of1ForFork0_push_#in~x#1| (- 4294967296)) (+ (div (+ (* |c_t1Thread1of1ForFork0_push_#in~x#1| (- 1)) 4) 4294967296) 1)) (<= 0 .cse1) (< .cse0 4294967296) (< |c_t1Thread1of1ForFork0_push_#in~x#1| 4294967296)))) is different from false Received shutdown request... [2021-11-13 17:54:35,895 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 17:54:35,895 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 17:54:35,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 17:54:35,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 17:54:35,902 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2021-11-13 17:54:36,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-11-13 17:54:36,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0 [2021-11-13 17:54:36,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2021-11-13 17:54:36,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Forceful destruction successful, exit code 0 [2021-11-13 17:54:37,119 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-11-13 17:54:37,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2021-11-13 17:54:37,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-13 17:54:37,139 WARN L594 AbstractCegarLoop]: Verification canceled: while executing Executor. [2021-11-13 17:54:37,139 INFO L764 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-11-13 17:54:37,141 INFO L732 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1] [2021-11-13 17:54:37,141 INFO L308 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork1 was TIMEOUT (3/3) [2021-11-13 17:54:37,142 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-11-13 17:54:37,142 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-13 17:54:37,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 05:54:37 BasicIcfg [2021-11-13 17:54:37,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-13 17:54:37,153 INFO L158 Benchmark]: Toolchain (without parser) took 847474.51ms. Allocated memory was 331.4MB in the beginning and 507.5MB in the end (delta: 176.2MB). Free memory was 274.9MB in the beginning and 192.4MB in the end (delta: 82.5MB). Peak memory consumption was 260.0MB. Max. memory is 16.0GB. [2021-11-13 17:54:37,153 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 331.4MB. Free memory is still 293.8MB. There was no memory consumed. Max. memory is 16.0GB. [2021-11-13 17:54:37,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 569.87ms. Allocated memory is still 331.4MB. Free memory was 274.6MB in the beginning and 284.7MB in the end (delta: -10.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.0GB. [2021-11-13 17:54:37,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.50ms. Allocated memory is still 331.4MB. Free memory was 284.7MB in the beginning and 282.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2021-11-13 17:54:37,154 INFO L158 Benchmark]: Boogie Preprocessor took 37.87ms. Allocated memory is still 331.4MB. Free memory was 282.6MB in the beginning and 280.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2021-11-13 17:54:37,155 INFO L158 Benchmark]: RCFGBuilder took 485.80ms. Allocated memory is still 331.4MB. Free memory was 280.5MB in the beginning and 264.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2021-11-13 17:54:37,155 INFO L158 Benchmark]: TraceAbstraction took 846310.94ms. Allocated memory was 331.4MB in the beginning and 507.5MB in the end (delta: 176.2MB). Free memory was 264.8MB in the beginning and 192.4MB in the end (delta: 72.4MB). Peak memory consumption was 250.6MB. Max. memory is 16.0GB. [2021-11-13 17:54:37,156 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 331.4MB. Free memory is still 293.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 569.87ms. Allocated memory is still 331.4MB. Free memory was 274.6MB in the beginning and 284.7MB in the end (delta: -10.2MB). Peak memory consumption was 17.8MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.50ms. Allocated memory is still 331.4MB. Free memory was 284.7MB in the beginning and 282.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.87ms. Allocated memory is still 331.4MB. Free memory was 282.6MB in the beginning and 280.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 485.80ms. Allocated memory is still 331.4MB. Free memory was 280.5MB in the beginning and 264.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 846310.94ms. Allocated memory was 331.4MB in the beginning and 507.5MB in the end (delta: 176.2MB). Free memory was 264.8MB in the beginning and 192.4MB in the end (delta: 72.4MB). Peak memory consumption was 250.6MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 70136, positive: 66157, positive conditional: 54615, positive unconditional: 11542, negative: 3979, negative conditional: 3951, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66547, positive: 66157, positive conditional: 54615, positive unconditional: 11542, negative: 390, negative conditional: 362, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66547, positive: 66157, positive conditional: 54615, positive unconditional: 11542, negative: 390, negative conditional: 362, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68192, positive: 66157, positive conditional: 54474, positive unconditional: 11683, negative: 2035, negative conditional: 1645, negative unconditional: 390, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68192, positive: 66157, positive conditional: 12205, positive unconditional: 53952, negative: 2035, negative conditional: 230, negative unconditional: 1805, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68192, positive: 66157, positive conditional: 12205, positive unconditional: 53952, negative: 2035, negative conditional: 230, negative unconditional: 1805, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7872, positive: 7827, positive conditional: 7, positive unconditional: 7820, negative: 45, negative conditional: 14, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7872, positive: 7819, positive conditional: 0, positive unconditional: 7819, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 45, negative conditional: 14, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, positive: 53, positive conditional: 4, positive unconditional: 49, negative: 67, negative conditional: 13, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68192, positive: 58330, positive conditional: 12198, positive unconditional: 46132, negative: 1990, negative conditional: 216, negative unconditional: 1774, unknown: 7872, unknown conditional: 21, unknown unconditional: 7851] , Statistics on independence cache: Total cache size (in pairs): 7872, Positive cache size: 7827, Positive conditional cache size: 7, Positive unconditional cache size: 7820, Negative cache size: 45, Negative conditional cache size: 14, Negative unconditional cache size: 31, Eliminated conditions: 43684, Maximal queried relation: 8, Independence queries for same thread: 3589 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 274.07ms, Number of persistent set computation: 1925, Number of trivial persistent sets: 1175, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 11570, positive: 11542, positive conditional: 0, positive unconditional: 11542, negative: 28, negative conditional: 0, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 70136, positive: 66157, positive conditional: 54615, positive unconditional: 11542, negative: 3979, negative conditional: 3951, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 66547, positive: 66157, positive conditional: 54615, positive unconditional: 11542, negative: 390, negative conditional: 362, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 66547, positive: 66157, positive conditional: 54615, positive unconditional: 11542, negative: 390, negative conditional: 362, negative unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 68192, positive: 66157, positive conditional: 54474, positive unconditional: 11683, negative: 2035, negative conditional: 1645, negative unconditional: 390, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 68192, positive: 66157, positive conditional: 12205, positive unconditional: 53952, negative: 2035, negative conditional: 230, negative unconditional: 1805, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 68192, positive: 66157, positive conditional: 12205, positive unconditional: 53952, negative: 2035, negative conditional: 230, negative unconditional: 1805, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7872, positive: 7827, positive conditional: 7, positive unconditional: 7820, negative: 45, negative conditional: 14, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7872, positive: 7819, positive conditional: 0, positive unconditional: 7819, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 8, positive conditional: 4, positive unconditional: 4, negative: 45, negative conditional: 14, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 120, positive: 53, positive conditional: 4, positive unconditional: 49, negative: 67, negative conditional: 13, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 68192, positive: 58330, positive conditional: 12198, positive unconditional: 46132, negative: 1990, negative conditional: 216, negative unconditional: 1774, unknown: 7872, unknown conditional: 21, unknown unconditional: 7851] , Statistics on independence cache: Total cache size (in pairs): 7872, Positive cache size: 7827, Positive conditional cache size: 7, Positive unconditional cache size: 7820, Negative cache size: 45, Negative conditional cache size: 14, Negative unconditional cache size: 31, Eliminated conditions: 43684, Maximal queried relation: 8, Independence queries for same thread: 3589 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4410, positive: 4390, positive conditional: 122, positive unconditional: 4268, negative: 20, negative conditional: 9, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 122, positive unconditional: 4268, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 122, positive unconditional: 4268, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 0, positive unconditional: 4390, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 0, positive unconditional: 4390, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 0, positive unconditional: 4390, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4154, positive: 4143, positive conditional: 0, positive unconditional: 4143, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4154, positive: 4142, positive conditional: 0, positive unconditional: 4142, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4403, positive: 247, positive conditional: 0, positive unconditional: 247, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 4154, unknown conditional: 0, unknown unconditional: 4154] , Statistics on independence cache: Total cache size (in pairs): 4154, Positive cache size: 4143, Positive conditional cache size: 0, Positive unconditional cache size: 4143, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 7 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 59.85ms, Number of persistent set computation: 97, Number of trivial persistent sets: 90, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4279, positive: 4268, positive conditional: 0, positive unconditional: 4268, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 4410, positive: 4390, positive conditional: 122, positive unconditional: 4268, negative: 20, negative conditional: 9, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 122, positive unconditional: 4268, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 122, positive unconditional: 4268, negative: 13, negative conditional: 2, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 0, positive unconditional: 4390, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 0, positive unconditional: 4390, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 4403, positive: 4390, positive conditional: 0, positive unconditional: 4390, negative: 13, negative conditional: 0, negative unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4154, positive: 4143, positive conditional: 0, positive unconditional: 4143, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4154, positive: 4142, positive conditional: 0, positive unconditional: 4142, negative: 12, negative conditional: 0, negative unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 12, positive: 1, positive conditional: 0, positive unconditional: 1, negative: 11, negative conditional: 0, negative unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 37, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 35, negative conditional: 0, negative unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4403, positive: 247, positive conditional: 0, positive unconditional: 247, negative: 2, negative conditional: 0, negative unconditional: 2, unknown: 4154, unknown conditional: 0, unknown unconditional: 4154] , Statistics on independence cache: Total cache size (in pairs): 4154, Positive cache size: 4143, Positive conditional cache size: 0, Positive unconditional cache size: 4143, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 7 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14075, positive: 13533, positive conditional: 5184, positive unconditional: 8349, negative: 542, negative conditional: 521, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 5184, positive unconditional: 8349, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 5184, positive unconditional: 8349, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 5093, positive unconditional: 8440, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 1112, positive unconditional: 12421, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 1112, positive unconditional: 12421, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7238, positive: 7217, positive conditional: 4, positive unconditional: 7213, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7238, positive: 7215, positive conditional: 0, positive unconditional: 7215, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13554, positive: 6316, positive conditional: 1108, positive unconditional: 5208, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7238, unknown conditional: 4, unknown unconditional: 7234] , Statistics on independence cache: Total cache size (in pairs): 7238, Positive cache size: 7217, Positive conditional cache size: 4, Positive unconditional cache size: 7213, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Eliminated conditions: 3981, Maximal queried relation: 0, Independence queries for same thread: 521 - StatisticsResult: Persistent set benchmarks Persistent set computation time: 114.39ms, Number of persistent set computation: 312, Number of trivial persistent sets: 121, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8370, positive: 8349, positive conditional: 0, positive unconditional: 8349, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 14075, positive: 13533, positive conditional: 5184, positive unconditional: 8349, negative: 542, negative conditional: 521, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 5184, positive unconditional: 8349, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 5184, positive unconditional: 8349, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 5093, positive unconditional: 8440, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 1112, positive unconditional: 12421, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 13554, positive: 13533, positive conditional: 1112, positive unconditional: 12421, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 7238, positive: 7217, positive conditional: 4, positive unconditional: 7213, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 7238, positive: 7215, positive conditional: 0, positive unconditional: 7215, negative: 23, negative conditional: 0, negative unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 23, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 21, negative conditional: 0, negative unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 62, positive: 2, positive conditional: 0, positive unconditional: 2, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 13554, positive: 6316, positive conditional: 1108, positive unconditional: 5208, negative: 0, negative conditional: 0, negative unconditional: 0, unknown: 7238, unknown conditional: 4, unknown unconditional: 7234] , Statistics on independence cache: Total cache size (in pairs): 7238, Positive cache size: 7217, Positive conditional cache size: 4, Positive unconditional cache size: 7213, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Eliminated conditions: 3981, Maximal queried relation: 0, Independence queries for same thread: 521 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 941]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 274 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 2.4s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 109, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2736 NumberOfCodeBlocks, 2736 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3574 ConstructedInterpolants, 0 QuantifiedInterpolants, 9348 SizeOfPredicates, 38 NumberOfNonLiveVariables, 2109 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 1556/4082 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 274 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 274 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 836.1s, OverallIterations: 15, TraceHistogramMax: 0, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, PartialOrderReductionTime: 335.8s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 647, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 496.6s InterpolantComputationTime, 5897 NumberOfCodeBlocks, 5687 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 8178 ConstructedInterpolants, 126 QuantifiedInterpolants, 108166 SizeOfPredicates, 298 NumberOfNonLiveVariables, 4657 ConjunctsInSsa, 480 ConjunctsInUnsatCore, 33 InterpolantComputations, 7 PerfectInterpolantSequences, 2877/9526 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown